English
Related papers

Related papers: LCD Cyclic Codes over Finite Fields

200 papers

In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic…

Information Theory · Computer Science 2012-05-30 Morgan Barbier , Christophe Chabot , Guillaume Quintin

In this paper we give the generalization of lifted codes over any finite chain ring. This has been done by using the construction of finite chain rings from $p$-adic fields. Further we propose a lattice construction from linear codes over…

Information Theory · Computer Science 2020-07-14 Reguia Lamia Bouzara , Kenza Guenda , Edgar Martínez-Moro

A linear code is linear complementary dual (LCD) if it meets its dual trivially. LCD codes have been a hot topic recently due to Boolean masking application in the security of embarked electronics (Carlet and Guilley, 2014). Additive codes…

Information Theory · Computer Science 2022-07-06 Minjia Shi , Na Liu , Jon-Lark Kim , Patrick Solé

Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $p\ge 5$ be an odd prime and $m$ be…

Information Theory · Computer Science 2022-08-31 Gaofei Wu , Huan Liu , Yuqing Zhang

In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…

Information Theory · Computer Science 2019-04-16 Irwansyah , Intan Muchtadi-Alamsyah , Aleams Barra

Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…

Information Theory · Computer Science 2024-11-12 Yaozong Zhang , Dabin Zheng , Xiaoqiang Wang

Cyclic liftings are proposed to lower the error floor of low-density parity-check (LDPC) codes. The liftings are designed to eliminate dominant trapping sets of the base code by removing the short cycles which form the trapping sets. We…

Information Theory · Computer Science 2010-02-24 Reza Asvadi , Amir H. Banihashemi , Mahmoud Ahmadian-Attari

A linear error correcting code is a subspace of a finite-dimensional space over a finite field with a fixed coordinate system. Such a code is said to be locally recoverable with locality $r$ if, for every coordinate, its value at a codeword…

Information Theory · Computer Science 2021-02-22 Cecília Salgado , Anthony Várilly-Alvarado , José Felipe Voloch

Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…

Information Theory · Computer Science 2022-01-05 Swati Bhardwaj , Madhu Raka

In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal…

Information Theory · Computer Science 2016-02-12 Giuliano G. La Guardia

The distance profiles of linear block codes can be employed to design variational coding scheme for encoding message with variational length and getting lower decoding error probability by large minimum Hamming distance. %, e.g. the design…

Information Theory · Computer Science 2013-06-05 Xiaogang Liu , Yuan Luo , Kenneth W. Shum

In this paper, by investigating the factor of the $x^n+1$, we deduce that the structure of the reversible negacyclic code over the finite field $\mathbb{F}_{q}$, where $q$ is an odd prime power. Though studying $q-$cyclotomic cosets modulo…

Information Theory · Computer Science 2021-01-21 Shixin Zhu , Binbin Pang , Zhonghua Sun

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. These codes were first introduced by Massey in 1964. Nowadays, LCD codes are extensively studied in the…

Information Theory · Computer Science 2021-09-15 Stefka Bouyuklieva

Reversible logic circuits have been historically motivated by theoretical research in low-power electronics as well as practical improvement of bit-manipulation transforms in cryptography and computer graphics. Recently, reversible circuits…

Emerging Technologies · Computer Science 2013-03-21 Mehdi Saeedi , Igor L. Markov

The locally repairable codes (LRCs) were introduced to correct erasures efficiently in distributed storage systems. LRCs are extensively studied recently. In this paper, we first deal with the open case remained in \cite{q} and derive an…

Information Theory · Computer Science 2015-06-17 Jun Zhang , Xin Wang , Gennian Ge

We explain how to optimize finite-length LDPC codes for transmission over the binary erasure channel. Our approach relies on an analytic approximation of the erasure probability. This is in turn based on a finite-length scaling result to…

Information Theory · Computer Science 2007-07-13 Abdelaziz Amraoui , Andrea Montanari , Ruediger Urbanke

Let $q$ be a power of a prime $p$. In this paper, we study reversible cyclic codes of arbitrary length over the ring $ R = \mathbb{F}_q + u \mathbb{F}_q$, where $u^2=0 mod q$. First, we find a unique set of generators for cyclic codes over…

Information Theory · Computer Science 2019-10-16 Om Prakash , Shikha Patel , Shikha Yadav

Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual are trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault…

Information Theory · Computer Science 2017-03-17 Claude Carlet , Sihem Mesnager , Chunming Tang , Yanfeng Qi

Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is…

Information Theory · Computer Science 2007-07-13 Alexandre Graell i Amat , Fredrik Brannstrom , Lars K. Rasmussen

Linear complementary dual (LCD) codes, which is a class of linear codes introduced by Massey, have been extensively studied in literature recently. It has been shown that LCD codes can help to improve the security of the information…

Information Theory · Computer Science 2020-10-21 Liangdong Lu , Xiuzhen Zhan , Sen Yang , Hao Cao