scientific article; zbMATH DE number 5054194
From MaRDI portal
Publication:5488377
zbMATH Open1098.94037MaRDI QIDQ5488377FDOQ5488377
Authors: Michael Braun, Alfred Wassermann, Axel Kohnert 
Publication date: 14 September 2006
Title of this publication is not available (Why is that?)
Recommendations
- Publication:4945067
- Construction of a class of linear codes
- scientific article; zbMATH DE number 3908334
- On the geometric constructions of optimal linear codes
- scientific article; zbMATH DE number 3882337
- Some (almost) optimally extendable linear codes
- Publication:3026904
- scientific article; zbMATH DE number 67082
- Linear codes from a generic construction
- scientific article; zbMATH DE number 3861051
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear codes (general theory) (94B05) Bounds on codes (94B65)
Cited In (27)
- An optimal linear code over \(\mathbb F_{11}\)
- Update on the Extension of Good Linear Codes
- Title not available (Why is that?)
- Some constructions of linearly optimal group codes
- Title not available (Why is that?)
- \((l,s)\)-extension of linear codes
- Optimal non-projective linear codes constructed from down-sets
- Forcing linearity on greedy codes
- Bounds on codes over an alphabet of five elements
- Title not available (Why is that?)
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear codes from a generic construction
- Construction of some binary linear codes of minimum distance five
- Title not available (Why is that?)
- Optimal Linear Codes From Matrix Groups
- Nonbinary double-error-correcting codes designed by means of algebraic varieties
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
- Title not available (Why is that?)
- A family of distance-optimal minimal linear codes with flexible parameters
- Title not available (Why is that?)
- Classification and nonexistence results for linear codes with prescribed minimum distances
- Construction of Linear Codes With Large Minimum Distance
- Constructing linear codes from some orbits of projectivities
- Construction of linear covering codes
- A Heuristic Algorithm for the Construction of Good Linear Codes
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 Q5488377)
