On generator polynomial matrices of quasi-cyclic codes with linear complementary duals

Using notion of generator polynomial matrices of quasi-cyclic codes, we show a necessary and sufficient condition for which these codes are to be linear complementary dual. This extends the well-known result by Yang and Massey on cyclic codes to quasi-cyclic codes. As an application we present various examples of optimal binary LCD quasi-cyclic codes.

Authors

Institutions

Publication Details

Journal
Journal of Algebra Combinatorics Discrete Structures and Applications
Published
2025-04-28
DOI
https://doi.org/10.13069/jacodesmath.v12i3.324
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On generator polynomial matrices of quasi-cyclic codes with linear complementary duals

Norifumi Ojiro, Hajime Matsui
Journal of Algebra Combinatorics Discrete Structures and Applications
Coding theory and cryptography
article

On generator polynomial matrices of quasi-cyclic codes with linear complementary duals

Norifumi Ojiro, Hajime Matsui
article en

Abstract

Using notion of generator polynomial matrices of quasi-cyclic codes, we show a necessary and sufficient condition for which these codes are to be linear complementary dual. This extends the well-known result by Yang and Massey on cyclic codes to quasi-cyclic codes. As an application we present various examples of optimal binary LCD quasi-cyclic codes.

Journal of Algebra Combinatorics Discrete Structures and ApplicationsVol. 12(3)
Toyota Technological Institute (JP)
Openalex Percentile: Top 88%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.