
arXiv: 1511.08889
A binary linear code is called {\em 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.
5 pages, 3 tables
FOS: Computer and information sciences, linear programming bounds, linear binary code, Computer Science - Information Theory, Information Theory (cs.IT), Metric Geometry (math.MG), LCD code, Mathematics - Metric Geometry, Linear programming, FOS: Mathematics, Linear binary code ; LCD code ; Linear programming bounds, Linear codes (general theory)
FOS: Computer and information sciences, linear programming bounds, linear binary code, Computer Science - Information Theory, Information Theory (cs.IT), Metric Geometry (math.MG), LCD code, Mathematics - Metric Geometry, Linear programming, FOS: Mathematics, Linear binary code ; LCD code ; Linear programming bounds, Linear codes (general theory)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
