Name
Abstract | ||
|---|---|---|
A binary linear code is called LCD if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on the size of an LCD code of given length and minimum distance. In addition, we show that this polynomial is, in general, an invariant of a matrix group of dimension 4 and order 12. Also, we sketch a Gleason formula for this weight enumerator. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.dam.2018.10.032 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Linear binary code,LCD code,Linear programming bounds | Enumerator polynomial,Discrete mathematics,Combinatorics,Polynomial,Liquid-crystal display,Invariant (mathematics),Linear programming,Code (cryptography),Mathematics,Dual code,Matrix group | Journal |
Volume | ISSN | Citations |
257 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adel Alahmadi | 1 | 24 | 11.27 |
| Michel Deza | 2 | 281 | 68.20 |
| Mathieu Dutour Sikiric | 3 | 18 | 4.50 |
| Patrick Solé | 4 | 636 | 89.68 |