The joint weight enumerator of an LCD code and its dual (Q1730215): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q128914197, #quickstatements; #temporary_batch_1723585310344 |
||
(9 intermediate revisions by 7 users not shown) | |||
Property / author | |||
Property / author: Adel N. Alahmadi / rank | |||
Property / author | |||
Property / author: Michel Marie Deza / rank | |||
Property / author | |||
Property / author: Mathieu Dutour Sikirić / rank | |||
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 | |||
Property / describes a project that uses | |||
Property / describes a project that uses: 4ti2 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: cdd / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963056680 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1511.08889 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complementary Dual Codes for Counter-Measures to Side-Channel Attacks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The combinatorics of LCD codes: linear programming bound and orthogonal matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalizations of Gleason's theorem on weight enumerators of self-dual codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear codes with complementary duals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q128914197 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:46, 13 August 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