A propagation rule for linear codes

DOI10.1007/S002009900017MaRDI QIDQ1573763zbMATH OpenOpenAlexFDO

Authors Harald Niederreiter, Chaoping Xing

Publication date 8 August 2000

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002009900017

zbMATH Keywords

algebraic-geometric codesfunction field extensionsglobal function fieldsoptimal linear codespropagation rule

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

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.

Recommendations

• Note on Niederreiter-Xing's propagation rule for linear codes
• A Generalization of Niederreiter–Xing's Propagation Rule and Its Commutativity With Duality
• Function-field codes
• scientific article; zbMATH DE number 2127873

Cited in

(11)

• Note on Niederreiter-Xing's propagation rule for linear codes
• On matrix-product structure of repeated-root constacyclic codes over finite fields
• Matrix product codes over finite commutative Frobenius rings
• Matrix-product structure of repeated-root cyclic codes over finite fields
• A Generalization of Niederreiter–Xing's Propagation Rule and Its Commutativity With Duality
• Matrix-product codes related to constacyclic codes and their applications to EAQEC codes
• Representation and matrix-product structure of type-1 constacyclic codes over \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
• The dimensions of Galois hulls of linear codes derived from an improved propagation rule and related applications
• Matrix product additive codes and M-symplectic duality with applications to EAQEC codes
• Construction and decoding of matrix-product codes from nested codes
• Function-field codes

This page was built for publication: A propagation rule for linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1573763)