On the covering radius of cyclic linear codes and arithmetic codes

DOI10.1016/S0166-218X(85)80006-8zbMATH Open0576.94020MaRDI QIDQ1065761FDOQ1065761

Authors: Tor Helleseth 

Publication date: 1985

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

Recommendations

• Some new upper bounds on the covering radius of binary linear codes
• On the covering radius of some binary cyclic codes
• scientific article; zbMATH DE number 721640
• On the covering radius of codes
• The covering radius of cyclic codes of length up to 31 (Corresp.)

zbMATH Keywords

minimum distanceBCH codesfinite fieldcovering radiusbinary codesbinary cyclic codecyclotomic numbersirreducible generator polynomial

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• The covering radii of a class of binary cyclic codes and some BCH codes
• The covering radius of the cycle code of a graph
• On the covering radius of long binary BCH codes
• On the number of solutions of certain diagonal equations over finite fields
• Diameter, covering index, covering radius and eigenvalues
• AN ALGORITHM FOR COMPUTING THE COVERING RADIUS OF A LINEAR CODE BASED ON VILENKIN-CHRESTENSON TRANSFORM
• The number of solutions of certain diagonal equations over finite fields
• The edge-forwarding index or orbital regular graphs
• Universal hash functions from exponential sums over finite fields and Galois rings
• Expanding and forwarding
• On (n, k, l, Δ)-systems
• On the parameters of codes for the Lee and modular distance
• The parameters of subcodes of algebraic-geometric codes over prime subfields
• Long binary narrow-sense BCH codes are normal
• Divisibility properties for covering radius of certain cyclic codes
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle
• On the covering radii of a class of binary primitive cyclic codes
• On the number of solutions of systems of certain diagonal equations over finite fields

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)