Skip to main content

Advertisement

Springer Nature Link
Log in

A Propagation Rule for Linear Codes

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract.

We establish a general theorem which, given an arbitrary linear code, generates a family of linear codes of larger lengths and higher dimensions. The proof is based on a representation of the given linear code as a (generalized) algebraic-geometry code. Examples yielding many optimal linear codes document the power of this theorem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Author information

Authors and Affiliations

  1. Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19, A-1010 Vienna, Austria (e-mail: niederreiter@oeaw.ac.at), , , , , , AT

    Harald Niederreiter

  2. Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore 117543 (e-mail: xingcp@math.nus.edu.sg), , , , , , SG

    Chaoping Xing

Authors
  1. Harald Niederreiter
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Chaoping Xing
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: July 5, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Niederreiter, H., Xing, C. A Propagation Rule for Linear Codes. AAECC 10, 425–432 (2000). https://doi.org/10.1007/s002009900017

Download citation

  • Issue Date:

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