On the minimum length of linear codes over the field of 9 elements
From MaRDI portal
Publication:521374
zbMATH Open1361.94054MaRDI QIDQ521374FDOQ521374
Authors: Kazuki Kumegawa, Ysukasa Okazaki, Tatsuya Maruta 
Publication date: 10 April 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p50
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Some bounds for the minimum length of binary linear codes of dimension nine
- Some new results on the minimum length of binary linear codes of dimension nine
- New minimum distance bounds for linear codes over \(GF\)(9)
- Publication:4488565
- scientific article; zbMATH DE number 2154114
- On the minimum length of some linear codes
- scientific article; zbMATH DE number 5524392
- On the size of optimal binary codes of length 9 and covering radius 1
- Minimal linear codes over finite fields
- New optimal binary linear codes of dimensions 9 and 10
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The correspondence between projective codes and 2-weight codes
- An extension theorem for linear codes
- A new extension theorem for linear codes
- An extension theorem for \([n,k,d]_q\) codes with \(\gcd(d,q)=2\)
- Title not available (Why is that?)
- Extension theorems for linear codes over finite fields
- Constructing linear codes from some orbits of projectivities
- Optimal ternary linear codes
- On the achievement of the Griesmer bound
- On the minimum size of some minihypers and related linear codes
- On the minimum length of \(q\)-ary linear codes of dimension four
- On the minimum length of linear codes over \(\mathbb{F}_5\)
- On optimal non-projective ternary linear codes
- On the geometric constructions of optimal linear codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Construction of optimal linear codes by geometric puncturing
- On the nonexistence of \(q\)-ary linear codes of dimension five
- On optimal ternary linear codes of dimension 6
- Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- On optimal linear codes over \(\mathbb F_8\)
- A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\)
- A geometric approach to classifying Griesmer codes
- NMDS codes of maximal length over F/sub q/,8≤q≤11
- On optimal linear codes over \(\mathbb F_5\)
- On the uniqueness of \((48,6)\)-arcs in PG\((2,9)\)
- Title not available (Why is that?)
Cited In (13)
- On the construction of optimal linear codes of dimension four
- On optimal linear codes of dimension 4
- Nonexistence of some linear codes over the field of order four
- Some new results on the minimum length of binary linear codes of dimension nine
- On the minimum length of linear codes of dimension 5
- Non-existence of some 4-dimensional Griesmer codes over finite fields
- Nonexistence of linear codes meeting the Griesmer bound
- Title not available (Why is that?)
- A new extension theorem for ternary linear codes and its application
- Locally two-weight property for linear codes and its application
- Nonexistence of some four dimensional linear codes attaining the Griesmer bound
- Nonexistence of some ternary linear codes
- Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9
This page was built for publication: On the minimum length of linear codes over the field of 9 elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521374)
