A propagation rule for linear codes (Q1573763)
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 1486221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A propagation rule for linear codes |
scientific article; zbMATH DE number 1486221 |
Statements
A propagation rule for linear codes (English)
0 references
8 August 2000
0 references
By a propagation rule it is meant a procedure or a theorem leading to new codes from old ones. The authors introduce a propagation rule for linear codes by considering certain function field extensions. The parameters (length, dimension, distance) of the new code are related to the parameters of the old code and also to three chosen integers. In the examples the authors show that their propagation rules lead to many optimal linear codes.
0 references
optimal linear codes
0 references
algebraic-geometric codes
0 references
global function fields
0 references
propagation rule
0 references
function field extensions
0 references
0.8849920630455017
0 references
0.8341898918151855
0 references
0.8307392597198486
0 references
