Results 121 to 130 of about 168,087 (140)
Characterization of linear complementary dual codes
openaire
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Rank-metric complementary dual codes
Journal of Applied Mathematics and Computing, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiusheng Liu, Hualu Liu
exaly +2 more sources
Construction of MDS codes with complementary duals
IEEE Transactions on Information Theory, 2016A linear complementary dual (LCD) code is a linear code with complimentary dual. LCD codes have been extensively studied in literature. On the other hand, maximum distance separable (MDS) codes are an important class of linear codes that have found wide applications in both theory and practice.
Lingfei Jin
exaly +2 more sources
On complementary dual quasi-twisted codes
Journal of Applied Mathematics and Computing, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saleh, A., Esmaeili, M.
exaly +2 more sources
On MDS linear complementary dual codes and entanglement-assisted quantum codes
Designs, Codes, and Cryptography, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfa Qian
exaly +2 more sources
On group codes with complementary duals
Designs, Codes and Cryptography, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Javier de la Cruz, Wolfgang Willems
openaire +1 more source
Theory of additive complementary dual codes, constructions and computations
Finite Fields and Their Applications, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Choi, Whan Hyuk +3 more
openaire +3 more sources
Additive complementary dual codes over $$\mathbb {F}_4$$
Designs, Codes and Cryptography, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minjia Shi +3 more
openaire +2 more sources
ON LINEAR COMPLEMENTARY DUAL FOUR CIRCULANT CODES
Bulletin of the Australian Mathematical Society, 2018We study linear complementary dual four circulant codes of length $4n$ over $\mathbb{F}_{q}$ when $q$ is an odd prime power. When $q^{\unicode[STIX]{x1D6FF}}+1$ is divisible by $n$, we obtain an exact count of linear complementary dual four circulant codes of length $4n$ over $\mathbb{F}_{q}$.
HONGWEI ZHU, MINJIA SHI
openaire +1 more source
Linear complementary dual codes over rings
Designs, Codes and Cryptography, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zihui Liu, Jinliang Wang
openaire +2 more sources

