Generalized hyperderivative Reed-Solomon codes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2051213 (Why is no real title available?)
- scientific article; zbMATH DE number 1795934 (Why is no real title available?)
- A combinatorial problem for vector spaces over finite fields
- BCH Codes for the Rosenbloom–Tsfasman Metric
- Bounds on ordered codes and orthogonal arrays
- Codes for the \(m\)-metric
- Constructions of digital nets using global function fields
- Higher Grassmann codes. II
- Introduction to Coding Theory
- MDS Poset-Codes Satisfying the Asymptotic Gilbert–Varshamov Bound in Hamming Weights
- Maximum distance separable poset codes
- On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics
- On linear ordered codes
- On lowest density MDS codes
- On the Minimum Distance, Minimum Weight Codewords, and the Dimension of Projective Reed-Muller Codes
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- Point sets and sequences with small discrepancy
- Poset codes: partial orders, metrics and coding theory
- Projective Reed-Muller codes
- Quasi-cyclic codes
- The Concatenated Structure of Quasi-Cyclic Codes and an Improvement of Jensen's Bound
- The automorphism group of a linear space with the Rosenbloom-Tsfasman metric
- The concatenated structure of cyclic and Abelian codes
This page was built for publication: Generalized hyperderivative Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238162)
