A propagation rule for linear codes (Q1573763): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s002009900017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075120475 / rank | |||
Normal rank | |||
Latest revision as of 18:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A propagation rule for linear codes |
scientific article |
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
