DocumentCode :
2061297
Title :
Bounds on codes derived by counting components in Varshamov graphs
Author :
O´Brien, Katie ; Fitzpatrick, Patrick
Author_Institution :
Dept. of Math., Univ. Coll. Cork, Ireland
fYear :
2004
fDate :
27 June-2 July 2004
Firstpage :
487
Abstract :
We develop methods for estimating the number of components in the Varshamov graph of a linear code and derive some new lower bounds on minimum distance for nonbinary codes.
Keywords :
linear codes; matrix algebra; parity check codes; Varshamov graph; counting component; linear code; nonbinary codes; Educational institutions; Equations; Iterative algorithms; Linear code; Mathematics; Parity check codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
Type :
conf
DOI :
10.1109/ISIT.2004.1365523
Filename :
1365523
Link To Document :
بازگشت