A geometric characterization of minimal codes and their asymptotic performance (Q2070261)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7461990
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A geometric characterization of minimal codes and their asymptotic performance |
scientific article; zbMATH DE number 7461990 |
Statements
A geometric characterization of minimal codes and their asymptotic performance (English)
0 references
24 January 2022
0 references
A codeword is said to minimal if its support does not contain the support of another independent codeword. A linear code is minimal if all its nonzero codewords are minimal. The authors give a geometric characterization of minimal linear codes, relating them to cutting blocking sets and derive bounds on the length and distance of minimal codes based on their dimension and field size. They prove that this family of codes is asymptotically good and give geometric constructions of the codes.
0 references
minimal codes
0 references
cutting blocking sets
0 references
asymptotically good codes
0 references
projective systems
0 references
secrete sharing schemes
0 references
0 references
0 references
0.8104187846183777
0 references
0.8059885501861572
0 references
0.8041473031044006
0 references
0.8010117411613464
0 references
0.8002700805664062
0 references
