Algorithms for computing parameters of graph-based extensions of BCH codes

DOI10.1016/j.jda.2006.08.002zbMath1134.94391OpenAlexW2046405103MaRDI QIDQ2466021

Andrei V. Kelarev

Publication date: 11 January 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.08.002

zbMATH Keywords

algorithmsdirected graphscodes

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Combinatorial codes (94B25)

Related Items (6)

CYCLIC CODES THROUGH B[X, $B[X;\frac{1}{kp}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON] ⋮ Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission ⋮ Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0\) and encoding] ⋮ CYCLIC CODES THROUGH $B[X;\frac{a}{b}{\mathbb Z}_{0}$, WITH $\frac{a}{b}\in {\mathbb Q}^{+}$ AND b = a+1, AND ENCODING] ⋮ A coding scheme that increases the code rate ⋮ A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code

Cites Work

• Computing in general Abelian groups is hard
• Extending and lengthening BCH codes.
• Construction and decoding of BCH codes over finite commutative rings
• New codes via the lengthening of BCH codes with UEP codes
• Transitive Graphs With Fewer Than Twenty Vertices
• On generalized Hamming weights of BCH codes
• On the decoding of Reed-Solomon and BCH codes over integer residue rings
• On minimum Lee weights of Hensel lifts of some binary BCH codes
• Finding short and light codewords in BCH codes
• Vertex-Magic Total Labelings Of Generalized Petersen Graphs
• The Parametrized Complexity of Some Fundamental Problems in Coding Theory
• Combinatorial Geometry and Graph Theory
• Combinatorial Geometry and Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for computing parameters of graph-based extensions of BCH codes