Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes

@article{Zeh2013GeneralizingBO,
  title={Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes},
  author={Alexander Zeh and Antonia Wachter-Zeh and Maximilien Gadouleau and Sergey V. Bezzateev},
  journal={2013 IEEE International Symposium on Information Theory},
  year={2013},
  pages={126-130}
}
Two generalizations of the Hartmann-Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to this bound is always possible and outline a quadratic-time syndrome-based error decoding algorithm. The second bound is stronger and the proof is more involved. Our technique of embedding the code into a cyclic product code can be applied to other… 

New bounds on the minimum distance of cyclic codes

TLDR
Two bounds on the minimum distance of cyclic codes are proposed, one generalizes the Roos bound and the other uses a second cyclic code, namely the non-zero-locator code, but is not directly related to cyclic product codes.

Decoding of repeated-root cyclic codes up to new bounds on their minimum distance

TLDR
This work presents a syndrome-based burst error decoding algorithm with guaranteed decoding radius based on an associated folded cyclic code and presents a third technique for bounding the minimum Hamming distance based on the embedding of a given repeated-rootcyclic code into a repeated- root cyclic product code.

Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance

On some bounds on the minimum distance of cyclic codes over finite fields

TLDR
Some results are presented on a generalization of a method to obtain new lower bounds on the minimum distance of cyclic codes over finite fields that applies to several examples ofcyclic codes.

Sum-rank product codes and bounds on the minimum distance

Spectral analysis of quasi-cyclic product codes

  • Alexander ZehS. Ling
  • Computer Science, Mathematics
    2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
TLDR
The spectralAnalysis of a quasi-cyclic product code in terms of the spectral analysis of the row- and the column-code is given and a new lower bound on the minimum Hamming distance of a given quasi- cyclic code is provided.

A survey on product codes and 2-D codes

TLDR
This note surveys cyclic product codes, direct product of various generalizations of cyclic codes and their properties.

Algebraic soft- and hard-decision decoding of generalized reed-solomon and cyclic codes

TLDR
The reformulation of the interpolation-based approach in terms of Key Equations for Generalized Reed--Solomon codes for both, the hard-dec decision variant by Guruswami--Sudan, as well as for the soft-decision approach by Kotter--Vardy are reformulated.

References

SHOWING 1-10 OF 24 REFERENCES

A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes

TLDR
A new bound on the minimum distance of q-ary cyclic codes is proposed, based on the description by another cyclic code with small minimum distance, and it turns out that lowest-code-ratecyclic codes withSmall minimum distances are useful for this approach.

Decoding Cyclic Codes up to a New Bound on the Minimum Distance

A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem bound and, for some codes, upon the Hartmann-Tzeng bound. Several

On the minimum distance of cyclic codes

TLDR
A new lower bound for the minimum distance of cyclic codes that includes earlier bounds (i.e., BCH bound, HT bound, Roos bound) is created and can be even stronger than the first one.

A new lower bound for the minimum distance of a cyclic code

  • Kees Roos
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1983
A new lower bound for the minimum distance of a linear code is derived. When applied to cyclic codes both the Bose-Chaudhuri-Hocquenghem (BCH) bound and the Hartmann-Tzeng (HT) bound are obtained as

A Generalization of the BCH Bound for Cyclic Codes, Including the Hartmann-Tzeng Bound

  • Kees Roos
  • Computer Science
    J. Comb. Theory, Ser. A
  • 1982

A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set

  • E. BettiM. Sala
  • Computer Science
    IEEE Transactions on Information Theory
  • 2006
TLDR
A new lower bound for the distance of cyclic codes is proposed, which improves upon the Bose-Chaudhuri-Hocquehghen bound and improves on the Hartmann-Tzeng bound and the Roos bound.

A symmetric Roos bound for linear codes

Further results on cyclic product codes

TLDR
The algebraic structure of cyclic product codes can be applied to establish the exact minimum distance of certain subclasses of BCH codes.

Cyclic product codes

TLDR
A new class of cyclic codes, cyclic product codes, is characterized and is shown to be capable of unambiguous correction of both bursts and random errors and to be a compromise between random and burst-error-correcting codes.

Cascade Decoding of Cyclic Product Codes

TLDR
It is shown how to synthesize simple decoders for cyclic product codes in the form of a cascade of decoder, each of which operates on one of the subcodes forming the product code.