scientific article; zbMATH DE number 3225713
From MaRDI portal
Publication:5514074
Cited in
(10)- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound
- Iterative decoding of linear codes by a modulo-2 linear program
- The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction
- Linear Network Error Correction Codes in Packet Networks
- A New Linear Programming Approach to Decoding Linear Block Codes
- Highly Robust Error Correction byConvex Programming
- Linear covering codes and error-correcting codes for limited-magnitude errors
- scientific article; zbMATH DE number 3458474 (Why is no real title available?)
- On linear codes which attain the Solomon-Stiffler bound
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 Q5514074)
