Application of circulant matrices to the construction and decoding of linear codes

DOI10.1109/18.57218zbMath0738.94016OpenAlexW2142366204MaRDI QIDQ3986488

Abraham Lempel, Ron M. Roth

Publication date: 27 June 1992

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

Full work available at URL: https://semanticscholar.org/paper/c5f5d28ad9778a21b4c024992aa1655d23987175

zbMATH Keywords

Fourier transformReed-Muller codeslinear codecirculant matrixReed-Solomon codesBerlekamp-Massey algorithmminimum distanceparity-check matrixdouble-circulant codesBlahut's algorithmBCH decoding algorithm

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (4)

Implementing quantum Fourier transform using three qubits ⋮ Four-dimensional almost Einstein manifolds with skew-circulant stuctures ⋮ Curvature properties of 4-dimensional Riemannian manifolds with a circulant structure ⋮ Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings \(\mathbb{F}_q[v_1,v_2,\dots,v_t\)]

This page was built for publication: Application of circulant matrices to the construction and decoding of linear codes