Minimum distances of error-correcting codes in incidence rings
The main theorem of this paper gives a formula for the largest minimum distance of error-correcting codes considered as ideals in incidence rings defined by directed graphs.
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
Hindawi Limited
2003-01-01
|
| coleção: | International Journal of Mathematics and Mathematical Sciences |
| Acesso em linha: | http://dx.doi.org/10.1155/S0161171203204063 |