Structure and performance of generalized quasi-cyclic codes
From MaRDI portal
Abstract: Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder Theorem yields a decomposition of GQC codes into a sum of concatenated codes. This decomposition leads to a trace formula, a minimum distance bound, and to a criteria for the GQC code to be self-dual or to be linear complementary dual (LCD). Explicit long GQC codes that are LCD, but not QC, are exhibited.
Recommendations
Cites work
- Complementary dual codes for counter-measures to side-channel attacks
- Generalized quasi-cyclic codes: Structural properties and code construction
- Good self-dual generalized quasi-cyclic codes exist
- Good self-dual quasi-cyclic codes exist
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3485627 (Why is no real title available?)
- scientific article; zbMATH DE number 1284436 (Why is no real title available?)
- scientific article; zbMATH DE number 2157472 (Why is no real title available?)
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- On the Algebraic Structure of Quasi-Cyclic Codes III: Generator Theory
- Optimum(n,2)codes for small values of channel error probability (Corresp.)
- Quasi-cyclic complementary dual codes
- The concatenated structure of cyclic and Abelian codes
- The Concatenated Structure of Quasi-Cyclic Codes and an Improvement of Jensen's Bound
Cited in
(45)- On the algebraic structure of quasi-cyclic codes. II: Chain rings
- Multiplicative structure and Hecke rings of generator matrices for codes over quotient rings of Euclidean domains
- Multi-twisted codes over finite fields and their dual codes
- Euclidean and Hermitian LCD MDS codes
- A bound on the minimum distance of generalized quasi-twisted codes
- Optimal binary codes derived from \(\mathbb{F}_2 \mathbb{F}_4\)-additive cyclic codes
- Generalized quasi-cyclic codes with arbitrary block lengths
- Quasi-cyclic codes: algebraic properties and applications
- Do non-free LCD codes over finite commutative Frobenius rings exist?
- Skew multi-twisted codes over finite fields and their Galois duals
- On generator and parity-check polynomial matrices of generalized quasi-cyclic codes
- On normalized generating sets for GQC codes over \(\mathbb{Z}_2\)
- Weight distribution of a subclass of \(\mathbb{Z}_2\)-double cyclic codes
- \(\mathbb{F}_2[u]\mathbb{F}_2[u]\)-additive cyclic codes are asymptotically good
- Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- Hulls of double cyclic codes
- Decomposing quasi-cyclic codes
- On generalizations of skew quasi-cyclic codes
- On the Algebraic Structure of Quasi-Cyclic Codes III: Generator Theory
- A special class of quasi-cyclic codes
- scientific article; zbMATH DE number 2157472 (Why is no real title available?)
- Structural properties and enumeration of 1-generator generalized quasi-cyclic codes
- 1-generator two-dimensional quasi-cyclic codes over $\mathbb{Z}_4[u]/\langle u^2-1\rangle$
- scientific article; zbMATH DE number 7688256 (Why is no real title available?)
- Two-sided Galois duals of multi-twisted codes
- The algebraic structure of additive codes over 𝔽2𝔽8
- An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem
- Quasi-cyclic and generalized quasi-cyclic codes and uniqueness of their generators
- On generalized quasi-cyclic codes over \(\mathbb{Z}_4\)
- Weight distribution of double cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- On the structure of the linear codes with a given automorphism
- \(\mathbb{Z}_4 \mathbb{Z}_4 \mathbb{Z}_4\)-additive cyclic codes are asymptotically good
- On some characterizations of generalized quasi-cyclic codes over \(\mathbb{Z}_q\)
- New distance bounds for quasi-cyclic codes
- Entanglement-assisted quantum error-correcting codes via quasi-cyclic codes with complementary duals
- Generator polynomial matrices of the Galois hulls of multi-twisted codes
- Multi-twisted codes as free modules over principal ideal domains
- \( \mathbb{F}_2 \mathbb{F}_2 [ u^2] \mathbb{F}_2 [ u^3]\)-additive cyclic codes are asymptotically good
- On the structure of monomial codes and their generalizations
- Characterizing a generator polynomial matrix for the dual of a multi-twisted code
- Every \(\mathbb{F}_q\)-linear code is equivalent to a multi-twisted code
- On quasi-cyclic codes as a generalization of cyclic codes
- A new minimum distance bound of generalized quasi-twisted codes
- Generalized quasi-cyclic codes: Structural properties and code construction
- On the Gröbner basis of a family of quasi-cyclic LDPC codes
This page was built for publication: Structure and performance of generalized quasi-cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401963)
