Sciweavers

4 search results - page 1 / 1
» Construction of MDS self-dual codes over Galois rings
Sort
View
DCC
2007
IEEE
14 years 4 months ago
Construction of MDS self-dual codes over Galois rings
The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-...
Jon-Lark Kim, Yoonjin Lee
TIT
2008
135views more  TIT 2008»
13 years 5 months ago
New MDS or Near-MDS Self-Dual Codes
We construct new MDS or near-MDS self-dual codes over large finite fields. In particular we show that there exists a Euclidean self-dual MDS code of length n = q over GF(q) wheneve...
T. Aaron Gulliver, Jon-Lark Kim, Yoonjin Lee
AAECC
2007
Springer
85views Algorithms» more  AAECC 2007»
13 years 11 months ago
Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF ( p , 2)
The uniform distribution of the trace map lends itself very well to the construction of binary and non-binary codes from Galois fields and Galois rings. In this paper we study the...
N. Pinnawala, A. Rao, T. Aaron Gulliver
JCT
2010
85views more  JCT 2010»
13 years 1 days ago
Symmetric bilinear forms over finite fields of even characteristic
Let Sm be the set of symmetric bilinear forms on an m-dimensional vector space over GF(q), where q is a power of two. A subset Y of Sm is called an (m, d)-set if the difference of...
Kai-Uwe Schmidt