Some new upper bounds on the covering radius of binary linear codes

DOI10.1109/18.42182MaRDI QIDQ3824229zbMATH OpenOpenAlexFDO

Authors Heeralal Janwa

Publication date 1989

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.42182

zbMATH Keywords

1-error- correcting quasi-perfect codescovering radiusgenerator polynomialminimum distanceNorse bounds

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Combinatorial codes (94B25)

Recommendations

• Bounds on the covering radius of linear codes
• New bounds for linear codes of covering radius 2
• New upper bounds for binary covering codes
• On covering radius lower bound for a class of binary codes
• Asymptotic bounds on the covering radius of binary codes
• New bounds for linear codes of covering radii 2 and 3
• On the covering radius of binary codes (Corresp.)
• On the covering radius of binary, linear codes meeting the Griesmer bound
• Binary codes with covering radius one: Some new lower bounds
• A new approach to the covering radius of codes

Cited in

(18)

• On the covering radius of cyclic linear codes and arithmetic codes
• A new approach to the covering radius of codes
• A note on the covering radius of optimum codes
• Generalization of the Norse bounds to codes of higher strength
• Asymptotic bounds on the covering radius of binary codes
• Linear inequalities for covering codes. I. Pair covering inequalities
• Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
• Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
• Linear inequalities for covering codes. II. Triple covering inequalities
• Constructions, families, and tables of binary linear covering codes
• An improvement of the Van Wee bound for binary linear covering codes
• On the covering radius of Simplex codes
• On the Newton and covering radii of linear codes
• Another upper bound on covering radius
• On Generalized Hamming Weights and the Covering Radius of Linear Codes
• Resolution of a conjecture on the covering radius of linear codes
• Constructions of covering sequences and 2D-sequences
• Some optimal codes from algebraic geometry and their covering radii

This page was built for publication: Some new upper bounds on the covering radius of binary linear codes

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