.png){kind=icon}
.png){kind=icon}
Return
Spectral Method for Quasi-Cyclic Code Analysis
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2012.091712.120834.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A generalization of the BCH bound to the case of quasi-cyclic codes is proposed. The new approach is based on eigenvalues of matrix polynomials. This results in improved minimum distance estimates compared to the existing bounds.
Keywords:
Quasi-cyclic codes
minimum distance estimation
BCH
eigenvalues
matrix polynomials
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W