On Quasi-Cyclic Codes as a Generalization of Cyclic Codes

W ithin this dissertation, new algebraic soft- and hard-decision decoding approaches for Generalized Reed–Solomon and linear cyclic codes, both defined over finite fields and in

In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH

The Quasi-Cyclic Moderate Density Parity Check (QC-MDPC) codes, proposed in [MTSB13], appear to be good candidate for replacing Goppa codes in a McEliece cryptosystem.. They have

First these equations have been considered as necessary conditions for establishing non existence properties of cyclic codes, such as the non existence of codewords of a given

The method of calculation of this formula leads us to introduce the notion of quasi Type IV codes: QSD codes whose torsion code is even, and to derive a mass formula for them...

The method of calculation of this formula leads us to introduce the notion of quasi Type IV codes: QSD codes whose torsion code is even, and to derive a mass formula for them..

In this article, we adapt this method to generate quasi self-dual (QSD) codes over the ring E, a non-unital, non-commutative ring of order 4. The ring E is one of the few

Reducible cyclic codes of rank 2 over Z p m are shown to have exactly two Hamming weights in some cases.. Their weight distribution is