Note on Niederreiter-Xing's Propagation Rule for Linear Codes

Abstract.

We present a simple construction of long linear codes from shorter ones. Our approach is related to the product code construction; it generalizes and simplifies substantially the recent “Propagation Rule” by Niederreiter and Xing. Many optimal codes can be produced by our method.

Similar content being viewed by others

On zero-error codes produced by greedy algorithms

Article Open access 02 November 2021

Three-weight linear codes from Weil sums

Article 04 January 2022

Remark on a Result of Constantine

Article 05 February 2018

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

• Artificial Intelligence

Author information

Authors and Affiliations

1. Middle East Technical University, Department of Mathematics, Ínönü Bulvari, 06531 Ankara, Turkey (e-mail: ozbudak@arf.math.metu.edu.tr), , , , , , TR

   Ferruh Özbudak

2. Universität Essen, FB 6 Mathematik, 45117 Essen, Germany (e-mail: stichtenoth@uni-essen.de), , , , , , DE

   Henning Stichtenoth

Authors

1. Ferruh Özbudak
   View author publications

   You can also search for this author in PubMed Google Scholar

2. Henning Stichtenoth
   View author publications

   You can also search for this author in PubMed Google Scholar

Additional information

Received: June 23, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Özbudak, F., Stichtenoth, H. Note on Niederreiter-Xing's Propagation Rule for Linear Codes. AAECC 13, 53–56 (2002). https://doi.org/10.1007/s002000100091

Download citation

• Issue Date: April 2002

• DOI: https://doi.org/10.1007/s002000100091

• Keywords: Linear Codes, Optimal codes, Product codes.