Two classes of optimal \(p\)-ary few-weight codes from down-sets (Q827599)
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 7293742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two classes of optimal \(p\)-ary few-weight codes from down-sets |
scientific article; zbMATH DE number 7293742 |
Statements
Two classes of optimal \(p\)-ary few-weight codes from down-sets (English)
0 references
13 January 2021
0 references
In this paper, the authors are interested in constructions of codes over the ring \(\mathbb{F}_p+u\mathbb{F}_p\), \(u^2=u\). They present two constructions using so called down-sets and when the down-sets are generated by a single maximal element, the Lee weight distributions of two classes of codes are computed. Further, using the Gray image of these codes the authors obtain two classes of minimal and distance optimal codes.
0 references
weight enumerator
0 references
simplicial complexes
0 references
Gray map
0 references
Griesmer bound
0 references
0.9109465479850768
0 references
0.8488871455192566
0 references
0.8415330648422241
0 references
0.8396349549293518
0 references
0.8238334059715271
0 references
