scientific article; zbMATH DE number 1505644

MaRDI QIDQ6483300zbMATH OpenFDO

Authors Jörn Quistorff

Published in Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Other types of codes (94B60) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• On the covering radius of codes
• On codes with covering radius 1 and minimum distance 2
• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
• scientific article; zbMATH DE number 4008282
• A remark on Haas' method
• Linear codes with covering radius 2 and other new covering codes
• On the structure of linear codes with covering radius two and three
• Covering radius 1985-1994
• New upper bounds for binary covering codes
• Some new lower bounds for binary and ternary covering codes

Cited in

(8)

• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
• New results on codes with covering radius 1 and minimum distance 2
• On codes with covering radius 1 and minimum distance 2
• On the minimum distance of Castle codes
• On a Sufficient Condition to Attain Minimum Square Distance in Euclidean Codes
• The minimum distance of codes in an array coming from telescopic semigroups
• On codes with distances \(d\) and \(n\)
• A [45,13] code with minimal distance 16

This page was built for publication:

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