On the minimum length of quaternary linear codes of dimension five (Q1301710)
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 1334523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum length of quaternary linear codes of dimension five |
scientific article; zbMATH DE number 1334523 |
Statements
On the minimum length of quaternary linear codes of dimension five (English)
0 references
12 February 2000
0 references
Let \(n_q(k,d)\) denote the smallest length of a linear code of length \(n\), dimension \(k\) and minimum distance \(d\). This paper proves the nonexistence of quaternary codes with parameters \([n,k,d]\) being one of \([190,5,141]\), \([239,5,178]\), \([275,5,205]\), \([288,5,215]\), \([291,5,217]\), or \([488,5,365]\). This leads to improved lower bounds for \(n_4(5,d)\) for \(d=141, 142\) and determines the precise value of \(n_4(5,d)\) for \(d=178, 205, 206, 215, 217, 218, 365, 366, 367, 368\). The paper also presents an updated table of \(n_4(5,d)\).
0 references
optimal codes
0 references
minihypers
0 references
nonexistence of quaternary codes
0 references
lower bounds
0 references
0 references
0.9414657950401306
0 references
0.9096277952194214
0 references
0.8991894721984863
0 references
