Construction of binary linear codes via rational function fields
From MaRDI portal
(Redirected from Publication:521865)
The authors present a novel construction of binary linear codes using the rational function field over characteristic two finite fields \(\mathbb{F}_q.\) Given \(r \leq (q^2 - q)/2 - 1,\) the method produces \([n,k,d]\) codes where \(n=q+1+2r,\) \(d \geq 2 \delta + 2,\) \(k \geq q + r - \delta \log_2 q\) for any \(\delta \geq 2.\) A number of examples are presented, many of which are optimal in the sense that the maximum distance is as large as possible.
Recommendations
Cited in
(12)- Families of rational functions over finite fields and constructions of optical orthogonal codes
- A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert–Varshamov Bound
- New Binary Codes From Rational Function Fields
- Disjoint Linear Codes From Algebraic Function Fields
- Construction of global function fields from linear codes and vice versa
- On integer-valued rational polynomials and depth distributions of binary codes
- scientific article; zbMATH DE number 4121931 (Why is no real title available?)
- Symmetric bilinear forms over finite fields with applications to coding theory
- Linear codes from functions
- A construction of codes with linearity from two linear codes
- A construction of binary linear codes in finite fields
- Conversion of Hensel codes to rational numbers
This page was built for publication: Construction of binary linear codes via rational function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521865)
