zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Lee-metric BCH codes and their application to constrained and partial- response channels. (English) Zbl 0816.94023
Summary: We show that each code in a certain class of BCH codes over $GF(p)$, specified by a code length $n \le p\sp m-1$ and a runlength $r \le (p - 1)/2$ of consecutive roots in $GF(p\sp m)$, has minimum Lee distance $\ge 2r$. For the very high-rate range these codes approach the sphere-packing bound on the minimum Lee distance. Furthermore, for a given $r$, the length range of these codes is twice as large as that attainable by Berlekamp’s extended negacyclic codes. We present an efficient decoding procedure, based on Euclid’s algorithm, for correcting up to $r - 1$ errors and detecting $r$ errors, that is, up to the number of Lee errors guaranteed by the designed minimum Lee distance $2r$. Bounds on the minimum Lee distance for $r \ge (p + 1)/2$ are provided for the Reed- Solomon case, i.e., when the BCH code roots are in $GF(p)$. We present two applications. First, Lee-metric BCH codes can be used for protecting against bitshift errors and synchronization errors caused by insertion and/or deletion of zeros in $(d,k)$-constrained channels. Second, the code construction with its decoding algorithm can be formulated over the integer ring, providing an algebraic approach to correcting errors in partial-response channels where matched spectral-null codes are used.

94B15Cyclic codes
94A40Channel models (including quantum)
Full Text: DOI