Name
Abstract | ||
|---|---|---|
As a continuation of the study of error-detecting correcting binary codes and codes over finite fields in general, several authors have been studying codes over some finite rings, particularly the ring Z(4) of integers modulo 4 and more generally codes over the ring Z(pn) of integers modulo p(n) (p a prime and n a positive integer). These rings are examples of Galois rings. In this note results appearing in the literature for codes over the ring Zpn are extended for codes over some Galois rings. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ITW.2006.1633792 | 2006 IEEE Information Theory Workshop |
Keywords | Field | DocType |
geometry,linearity,finite field,mathematics,polynomials,galois fields,sections,binary codes,error detection | Embedding problem,Discrete mathematics,Finite field,Splitting of prime ideals in Galois extensions,Block code,Expander code,Field norm,Linear code,Galois module,Mathematics | Conference |
Citations | PageRank | References |
1 | 0.37 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Horacio Tapia-Recillas | 1 | 32 | 6.12 |