Linear complementary pairs of codes over rings
Let \(C\) and \(D\) are two linear codes of length \(n\) over finite commutative ring with identity \(R\) such that \(C\cap D = \{0\}\) and \(C\oplus D = R^n,\) then we call such \((C, D)\) a linear complementary pair (LCP) of codes over \(R.\) LCP code are of particular interest for their applications in cryptography. This work introduces a generalization of LCP of codes over finite fields to LCP of codes over finite rings and a criterion for LCP of linear codes over finite rings is shown. In particular, free LCP of codes over finite commutative rings are characterized. Using the characterization of free LCP of codes, a maximum distance separable LCP of codes over ring \(\mathbb{Z}_4\) is constructed as an example. The authors give a necessary and sufficient condition for a pair of linear codes over finite chain rings to be LCP. Special attention is devoted to investigate constacyclic and quasi-cyclic LCP of codes over finite chain rings. As a result a characterizations for LCP of constacyclic codes and LCP of quasi-cyclic codes is obtained. This result for the constacyclic and quasi-cyclic complementary pairs extends the characterization of LCP of constacyclic and quasi-cyclic codes known before. Lastly, some results about general LCP of codes and free cyclic LCD codes over principal ideal rings are established.
- \(\sigma\)-LCD codes over finite chain rings
- A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u]/\langle u^m\rangle\)
- A note on linear complementary pairs of group codes
- Complementary dual codes for counter-measures to side-channel attacks
- Complementary dual codes for counter-measures to side-channel attacks
- Construction of some codes suitable for both side channel and fault injection attacks
- Constructions of optimal LCD codes over large finite fields
- Do non-free LCD codes over finite commutative Frobenius rings exist?
- Double circulant LCD codes over \(\mathbb{Z}_4\)
- scientific article; zbMATH DE number 5896977 (Why is no real title available?)
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Independence of vectors in codes over rings
- LCD codes over finite chain rings
- Linear codes with complementary duals
- Linear complementary dual codes over rings
- Linear complementary pair of group codes over finite chain rings
- Matrix product codes over finite commutative Frobenius rings
- MDS codes over finite principal ideal rings
- On group codes with complementary duals
- On Linear Complementary Pairs of Codes
- On self-dual negacirculant codes of index two and four
- On the algebraic structure of quasi-cyclic codes. II: Chain rings
- On the characterization of cyclic codes over two classes of rings
- On the Hamming distance of linear codes over a finite chain ring
- On the structure of linear and cyclic codes over a finite chain ring
- Projective modules
- Quasi-twisted codes with constacyclic constituent codes
- Self-dual codes and orthogonal matrices over large finite fields
- Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
- Linear complementary pair of group codes over finite chain rings
- Linear \(\ell \)-intersection pairs of codes and their applications
- Linear complementary dual codes over rings
- \(l\)-LIPs of codes over finite chain rings
- LCP of group codes over finite Frobenius rings
- scientific article; zbMATH DE number 1166238 (Why is no real title available?)
- scientific article; zbMATH DE number 1498809 (Why is no real title available?)
- Linear Network Coding Over Rings – Part I: Scalar Codes and Commutative Alphabets
- LCP of matrix product codes
- LCP of rank metric codes and its an application
- Linear \(\ell\)-intersection pairs of cyclic and quasi-cyclic codes over a finite field \({\mathbb{F}}_q\)
- Corrigendum to: ``\(l\)-LIPs of codes over finite chain rings
- LCP of constacyclic codes over finite chain rings
- On the \(\ell\)-DLIPs of codes over finite commutative rings
- Linear codes and linear complementary pairs of codes over a non-chain ring
- \( \mathbb{Z}_2 \mathbb{Z}_4\)-ACP of codes and their applications to the noiseless two-user binary adder channel
- Linear complementary pairs of constacyclic n-D codes over a finite commutative ring
- On Galois LCD codes and LCPs of codes over mixed alphabets
- Linear complementary pairs of codes over a finite non-commutative Frobenius ring
- On LCP mixed-alphabet group codes over finite chain rings
- \( \mathbb{F}_2\mathbb{F}_4\)-ACP of codes
This page was built for publication: Linear complementary pairs of codes over rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234463)
