On the covering radius of cyclic linear codes and arithmetic codes
From MaRDI portal
It is shown that the problem of finding the covering radius of a binary cyclic code with irreducible generator polynomial is equivalent to Waring's problem in \(GF(2^ m)\). An upper bound for the covering radius of some binary codes together with similar results for arithmetic codes is also given.
Recommendations
Cites work
- A note on Waring's problem in GF (p)
- All binary 3-error-correcting BCH codes of length<tex>2^m-i</tex>have covering radius 5 (Corresp.)
- Bounds for exponential sums
- Complete decoding of triple-error-correcting binary BCH codes
- Equations et variétés algébriques sur un corps fini
- Four fundamental parameters of a code and their combinatorial significance
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3252237 (Why is no real title available?)
- scientific article; zbMATH DE number 3252438 (Why is no real title available?)
- scientific article; zbMATH DE number 3280208 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- scientific article; zbMATH DE number 3405819 (Why is no real title available?)
- On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.)
- On the inherent intractability of certain coding problems (Corresp.)
- Solution of Waring's Problem \opertornameMod n
- Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
- The weight distribution of irreducible cyclic codes with block lengths n₁ ((q^-1)/N)
- Two-error correcting Bose-Chaudhuri codes are quasi-perfect
- Waring's Problem \opertornameMod n
- Weak radix representation and cyclic codes over euclidean domains
- Weights of irreducible cyclic codes
Cited in
(22)- On the covering radius of long binary BCH codes
- Diameter, covering index, covering radius and eigenvalues
- On the parameters of codes for the Lee and modular distance
- The parameters of subcodes of algebraic-geometric codes over prime subfields
- The number of solutions of certain diagonal equations over finite fields
- The edge-forwarding index or orbital regular graphs
- Long binary narrow-sense BCH codes are normal
- The covering radii of a class of binary cyclic codes and some BCH codes
- Expanding and forwarding
- On the number of solutions of systems of certain diagonal equations over finite fields
- On the number of solutions of certain diagonal equations over finite fields
- Universal hash functions from exponential sums over finite fields and Galois rings
- Divisibility properties for covering radius of certain cyclic codes
- On (n, k, l, Δ)-systems
- On the covering radii of a class of binary primitive cyclic codes
- AN ALGORITHM FOR COMPUTING THE COVERING RADIUS OF A LINEAR CODE BASED ON VILENKIN-CHRESTENSON TRANSFORM
- Determining the exact value of the second-order generalized covering radius of two classes of binary cyclic codes
- The covering radius of the cycle code of a graph
- The Sperner capacity of linear and nonlinear codes for the cyclic triangle
- The third generalized covering radius for binary primitive double-error-correcting BCH codes
- The second generalized covering radius of binary primitive double-error-correcting BCH codes
- On the second generalized covering radius for binary primitive triple-error-correcting BCH codes
This page was built for publication: On the covering radius of cyclic linear codes and arithmetic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065761)
