Abstract | ||
---|---|---|
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 Rk. 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. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1504/IJICOT.2017.10004700 | International Journal of Information and Coding Theory |
Field | DocType | Volume |
Hamming code,Discrete mathematics,Combinatorics,Concatenated error correction code,Group code,Block code,Expander code,Reed–Solomon error correction,Reed–Muller code,Linear code,Mathematics | Journal | 4 |
Issue | ISSN | Citations |
2-3 | 1753-7703 | 22 |
PageRank | References | Authors |
1.40 | 5 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Steven T. Dougherty | 1 | 168 | 38.04 |
Jon-Lark Kim | 2 | 312 | 34.62 |
buket ozkaya | 3 | 37 | 5.15 |
Lin Sok | 4 | 47 | 10.38 |
Patrick Solé | 5 | 636 | 89.68 |