Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components

DOI10.1112/JLMS/S2-1.1.493MaRDI QIDQ5584557zbMATH OpenOpenAlexFDO

Authors R. G. Stanton, J. D. Horton, J. G. Kalbfleisch

Publication date 1969

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-1.1.493

zbMATH Keywords

covering sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cited in

(10)

• New upper bounds for binary covering codes
• Lower bounds for \(q\)-ary coverings by spheres of radius one
• A covering problem over finite rings
• On covering sets and error-correcting codes
• Bounds for covering codes over large alphabets
• New results on codes with covering radius 1 and minimum distance 2
• The covering problem in Rosenbloom-Tsfasman spaces
• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• On covering and coloring problems for rook domains
• On maximal partial Latin hypercubes

This page was built for publication: Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5584557)