The combinatorics of LCD codes: linear programming bound and orthogonal matrices (Q1664083)
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: The combinatorics of LCD codes: linear programming bound and orthogonal matrices |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The combinatorics of LCD codes: linear programming bound and orthogonal matrices |
scientific article |
Statements
The combinatorics of LCD codes: linear programming bound and orthogonal matrices (English)
0 references
24 August 2018
0 references
Summary: Linear complementary dual (LCD) codes are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings \(R_k\). We give a linear programming bound on the largest size of an LCD code of given length and minimum distance. We make a table of lower bounds for this combinatorial function for modest values of the parameters.
0 references
LCD (linear codes with complementary dual) codes
0 references
linear programming bound
0 references
self-dual codes
0 references
