Title
The Nordstrom-Robinson code is algebraic-geometric
Abstract
The techniques of algebraic geometry have been widely and successfully applied to the study of linear codes over finite fields since the early 1980s. There has also been an increased interest in the study of linear codes over finite rings. In a previous paper, we combined these two approaches to coding theory by introducing and studying algebraic-geometric codes over rings. We show that the Nordstrom-Robinson code is the image under the Gray mapping of an algebraic-geometric code over Z/4Z
Year
DOI
Venue
1997
10.1109/18.623154
IEEE Transactions on Information Theory
Keywords
Field
DocType
algebraic geometric codes,linear codes,Gray mapping,Nordstrom-Robinson code,algebraic geometry,algebraic-geometric codes,coding theory,finite fields,finite rings,linear codes,nonlinear image
Discrete mathematics,Combinatorics,Algebra,Constant-weight code,Systematic code,Computer science,Block code,Polynomial code,Cyclic code,Reed–Muller code,Linear code,Dual code
Journal
Volume
Issue
ISSN
43
5
0018-9448
Citations 
PageRank 
References 
1
0.52
1
Authors
5
Name
Order
Citations
PageRank
Walker, J.L.110.52
SM Huang210.85
T Petros310.52
MC Sanudo-Pena410.52
B Vilner510.52