Linear Codes over Fq[x]/(x2) and GR(p2, m) Reaching the Griesmer Bound
Abstract & Figures
Sorry, we couldn't extract an abstract for this paper.
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.
Sorry, we couldn't extract any citations for this paper.
Sorry, we couldn't extract any references for this paper.
Loading similar papers…
Slides referencing similar topics
Sphere covering (Gilbert-Varshamov) bound Improved Gilbert-Varshamov bound for linear codes Plotkin bound Singleton bound and MDS codes
Wei Dai • Jul 15, 2015
The Reachability-Bound Problem
Oct 01, 2014
Linear codes over finite rings and modules
Jay A. Wood • Jul 14, 2015