On the covering radius of cyclic linear codes and arithmetic codes

DOI10.1016/S0166-218X(85)80006-8zbMath0576.94020MaRDI QIDQ1065761

Tor Helleseth

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

BCH codescovering radiusfinite fieldbinary codescyclotomic numbersminimum distancebinary cyclic codeirreducible generator polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Cyclic codes (94B15) Arithmetic codes (94B40) Cyclotomy (11T22)

Related Items (15)

The edge-forwarding index or orbital regular graphs ⋮ On the covering radius of long binary BCH codes ⋮ Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings ⋮ Long binary narrow-sense BCH codes are normal ⋮ On the number of solutions of certain diagonal equations over finite fields ⋮ On the covering radii of a class of binary primitive cyclic codes ⋮ Diameter, covering index, covering radius and eigenvalues ⋮ The covering radii of a class of binary cyclic codes and some BCH codes ⋮ On the parameters of codes for the Lee and modular distance ⋮ The parameters of subcodes of algebraic-geometric codes over prime subfields ⋮ The covering radius of the cycle code of a graph ⋮ The number of solutions of certain diagonal equations over finite fields ⋮ On (n, k, l, Δ)-systems ⋮ Expanding and forwarding ⋮ On the number of solutions of systems of certain diagonal equations over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
• Equations et variétés algébriques sur un corps fini
• Two-error correcting Bose-Chaudhuri codes are quasi-perfect
• On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.)
• Complete decoding of triple-error-correcting binary BCH codes
• Weak radix representation and cyclic codes over euclidean domains
• Waring's Problem \opertornameMod n
• All binary 3-error-correcting BCH codes of length<tex>2^m-i</tex>have covering radius 5 (Corresp.)
• On the inherent intractability of certain coding problems (Corresp.)
• Solution of Waring's Problem \opertornameMod n
• A note on Waring's problem in GF (p)
• Four fundamental parameters of a code and their combinatorial significance
• Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
• Weights of irreducible cyclic codes
• Bounds for exponential sums

This page was built for publication: On the covering radius of cyclic linear codes and arithmetic codes