The joint weight enumerator of an LCD code and its dual (Q1730215): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Adel N. Alahmadi / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Michel Marie Deza / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Mathieu Dutour Sikirić / rank | |||
Normal rank |
Revision as of 20:38, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The joint weight enumerator of an LCD code and its dual |
scientific article |
Statements
The joint weight enumerator of an LCD code and its dual (English)
0 references
11 March 2019
0 references
A binary code \(C\) is said to be an LCD code if \(C \cap C^\perp = \{\mathbf{0} \}.\) The joint weight enumerator of two codes \(C\) and \(D\) is defined as \(J(C,D) (a,b,c,d) = \sum_{u \in C,v \in D}a^{i(u,v)} b^{j(u,v)} c^{k(u,v)} d^{l(u,v)} \), where \(i(u,v)\) is the number of occurrences of \((0,0)\), \(j(u,v)\) is the number of occurrences of \((0,1)\), \(k(u,v)\) is the number of occurrences of \((1,0)\), and \(l(u,v)\) is the number of occurrences of \((1,1)\). The authors produce a linear programming bound on the size of an LCD code with a given length and minimum distance by examining the coefficients of the joint weight enumerator using the codes \(C\) and \(C^\perp.\) Additionally, they show how classical invariant theory can be used to show that the joint weight enumerator is an invariant of a matrix group of dimension \(4\) and order \(12\).
0 references
linear binary code
0 references
LCD code
0 references
linear programming bounds
0 references