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.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2003-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S0161171203204063 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|