Results 161 to 170 of about 24,233 (175)

Hermitian LCD codes from cyclic codes

Designs, Codes and Cryptography, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

$$\sigma $$-LCD codes over finite chain rings

Designs, Codes and Cryptography, 2019
In this paper, the authors studied the $\sigma$-LCD codes over finite chain rings. They characterize $\sigma$-LCD linear codes over finite chain rings by using their generator matrix. A necessary and sufficient condition for a linear code to be $\sigma$-LCD over a series of finite chain rings is given.
Liu, Xiusheng, Liu, Hualu
openaire   +2 more sources

LCD codes from adjacency matrices of graphs

Applicable Algebra in Engineering, Communication and Computing, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Key, J. D., Rodrigues, B. G.
openaire   +2 more sources

Around LCD group codes

Designs, Codes and Cryptography
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de la Cruz, Javier, Willems, Wolfgang
openaire   +1 more source

On LCD skew group codes

Designs, Codes and Cryptography
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
El Badry, Mohammed, Haily, Abdelfattah, Mounir, Ayoub   +2 more
openaire   +2 more sources

LCD codes over finite fields

Discrete Mathematics, Algorithms and Applications
In this paper, we introduce several new construction techniques of linear complimentary dual (LCD) codes. First, we show that if a LCD code is fixed by a transitive automorphism group, then the punctured code is also LCD. We show that several important families such as anti-primitive BCH codes and extended Gabidulin codes are LCD.
N. Zoubir, Kenza Guenda, Padmapani Seneviratne, T. Aaron Gulliver   +3 more
openaire   +1 more source

New LCD MDS codes constructed from generalized Reed–Solomon codes

Journal of Algebra and Its Applications, 2019
Maximum distance separable codes with complementary duals (LCD MDS codes) are very important in coding theory and practice, and have attracted a lot of attention. In this paper, we focus on LCD MDS codes constructed from generalized Reed–Solomon (GRS) codes over a finite field with odd characteristic.
Shi, Xueying, Yue, Qin, Yang, Shudi
openaire   +2 more sources

LCD codes over Galois rings

Computational and Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F. Rebaine, K. Guenda, T. A. Gulliver
openaire   +1 more source

Locally maximal recoverable codes and LMR-LCD codes

Designs, Codes and Cryptography
The paper introduces two new classes of \((r,\delta)\)-locally recoverable codes (LRCs), called locally maximal recoverable (LMR) codes and \(\lambda\)-maximally recoverable (MR) codes. These generalize the well-studied \((n,k,r,\delta,h)\)-MR codes, where \(h\) heavy (global) parities are added to \(k\) information symbols, then partitioned into ...
Rajendra Prasad Rajpurohit, Maheshanand Bhaintwal, Charul Rajput   +2 more
openaire   +3 more sources

Some constructions of $l$-Galois LCD codes

Advances in Mathematics of Communications
Let \({\mathbb F}_q\) be the finite field with \(q = p^m\) elements. The Galois inner product is a generalization of Hermitian and Euclidean inner products. It's defined as \(a\ast_ l b= \sum\limits_{i=1}^{n}a_ib_i^{p^l},\) where \(0\leq l\leq m-1.\) Similarly, we can define the \(l\)-Galois dual code of \(C\) as \(C^{\bot_l}=\{a\in \mathbb{F}_q^n\vert
Yadav, Shikha, Debnath, Indibar, Prakash, Om   +2 more
openaire   +2 more sources