Bounds for covering codes over large alphabets (Q2572977): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Patric R. J. Östergård / rank
Normal rank
 
Property / author
 
Property / author: Patric R. J. Östergård / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-004-3804-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976943345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An updated table of binary/ternary mixed covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on bounds for q-ary covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: More coverings by rook domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state of strength-three covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for q-ary covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing strength three covering arrays with augmented annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On saturating sets in small projective geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rook domains, Latin squares, affine planes, and error-distributing codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for \(q\)-ary codes of covering radius one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified bounds for covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graham-Sloane type construction for \(s\)-surjective matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem in Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group construction of covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new table of binary/ternary mixed covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for binary covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the football pool problem for six matches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings by rook domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces / rank
 
Normal rank

Latest revision as of 12:23, 11 June 2024

scientific article
Language Label Description Also known as
English
Bounds for covering codes over large alphabets
scientific article

    Statements

    Bounds for covering codes over large alphabets (English)
    0 references
    0 references
    7 November 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    covering code
    0 references
    covering radius
    0 references
    surjective code
    0 references
    0 references