Three-weight minimal linear codes (Q2147618): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s40840-022-01247-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4210789223 / rank | |||
Normal rank |
Revision as of 02:29, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Three-weight minimal linear codes |
scientific article |
Statements
Three-weight minimal linear codes (English)
0 references
20 June 2022
0 references
The author explains the necessary and sufficient condition for a linear code over \(R\) to be minimal. Also, it is proved that if \(C\) is minimal then \(\phi(C)\) is minimal. The infinite family of Lee weight linear codes is constructed and the family of minimal ternary three Hamming weight linear codes over the finite field \(\mathbb{F}_3\) is determined, this result which helps to violate the Ashikhmin-Barg condition. In this connection, the author provides all the references clearly.
0 references
minimal linear codes
0 references
Boolean functions
0 references