An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem (Q6156917)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem |
scientific article; zbMATH DE number 7697477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem |
scientific article; zbMATH DE number 7697477 |
Statements
An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem (English)
0 references
19 June 2023
0 references
error-correcting codes
0 references
reversed codes
0 references
reversible codes
0 references
dual codes
0 references
self-dual codes
0 references
linear codes
0 references
generator polynomial matrices
0 references
reciprocal polynomials
0 references
0.89698815
0 references
0.8948902
0 references
0.8770888
0 references
0.8764701
0 references
0.87521595
0 references
0 references
0 references
