The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces (Q2515553): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Codes with a poset metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical- systematic form for codes in hierarchical poset metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of Niederreiter–Rosenbloom–Tsfasman Block Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The poset structures admitting the extended binary Hamming code to be a perfect code / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method of syntax specification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Notes on Notation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete anytime algorithm for number partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem for vector spaces over finite fields / rank
 
Normal rank

Revision as of 14:44, 10 July 2024

scientific article
Language Label Description Also known as
English
The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces
scientific article

    Statements

    Identifiers