Lee-metric BCH codes and their application to constrained and partial-response channels

DOI10.1109/18.335966zbMath0816.94023OpenAlexW2132083478MaRDI QIDQ4324169

Ron M. Roth, Paul H. Siegel

Publication date: 1 March 1995

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

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

zbMATH Keywords

BCH codesdecodingLee distancepartial-response channelsLee-metricconstrained channels

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40)

Related Items (15)

Information set decoding in the Lee metric with applications to cryptography ⋮ More on solving systems of power equations ⋮ Restriction conditions on \(\mathrm{PL}(7, 2)\) codes \((3 \le \vert\mathcal{G}_i\vert \le 7)\) ⋮ Fast decoding of quasi-perfect Lee distance codes ⋮ Density of free modules over finite chain rings ⋮ Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets ⋮ Constructive spherical codes near the Shannon bound ⋮ On linear diameter perfect Lee codes with distance 6 ⋮ On the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheres ⋮ Duplication-correcting codes ⋮ Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \) ⋮ On maximum Lee distance codes ⋮ Lower bounds on the minimum distance of long codes in the Lee metric ⋮ An algebra of discrete channels that involve combinations of three basic error types ⋮ Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes

This page was built for publication: Lee-metric BCH codes and their application to constrained and partial-response channels