scientific article; zbMATH DE number 3861051
From MaRDI portal
Publication:3329370
zbMATH Open0541.94016MaRDI QIDQ3329370FDOQ3329370
Authors: Noboru Hamada, F. Tamari 
Publication date: 1983
Title of this publication is not available (Why is that?)
Recommendations
- A class of optimal linear codes of length one above the Griesmer bound
- scientific article; zbMATH DE number 3908334
- scientific article; zbMATH DE number 5054194
- Publication:4945067
- A generalized extension theorem for linear codes
- Linear codes close to the Griesmer bound and the related geometric structures
- Note on an improvement of the Griesmer bound for \(q\)-ary linear codes
- On the nonexistence of \(g\)-ary linear codes attaining the Griesmer bound.
- On the non-existence of linear codes attaining the Griesmer bound
- On the geometric constructions of optimal linear codes
Cited In (8)
- Title not available (Why is that?)
- Optimal non-projective linear codes constructed from down-sets
- Forcing linearity on greedy codes
- Title not available (Why is that?)
- A Generalized Construction and Improvements on Nonbinary Codes From Goppa Codes
- A characterization of certain Griesmer codes: MMD codes in a more general sense
- A class of optimal linear codes of length one above the Griesmer bound
- Linear codes close to the Griesmer bound and the related geometric structures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3329370)
