Ternary Hamming and binary perfect covering codes

MaRDI QIDQ2717198zbMATH OpenFDO

Authors Kevin T. Phelps, Italo J. Dejter

Publication date 18 September 2001

zbMATH Keywords

binary perfect covering codesperfect dominating setternary Hamming code

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Ternary covering codes derived from BCH codes
• Mixed binary/ternary covering codes
• scientific article; zbMATH DE number 2108129
• A class of perfect ternary constant-weight codes
• Some new lower bounds for ternary covering codes
• A new class of ternary cocyclic Hadamard codes
• Some new lower bounds for binary and ternary covering codes
• A new table of binary/ternary mixed covering codes
• On perfect ternary constant weight codes
• scientific article; zbMATH DE number 1522575

Cited in

(2)

• A generalization of Lee codes
• An updated table of binary/ternary mixed covering codes

This page was built for publication: Ternary Hamming and binary perfect covering codes

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