Minimum distances of error-correcting codes in incidence rings (Q1864318)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum distances of error-correcting codes in incidence rings |
scientific article |
Statements
Minimum distances of error-correcting codes in incidence rings (English)
0 references
17 March 2003
0 references
Summary: 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.
0 references
semigroup rings
0 references
minimum distance
0 references
error-correcting codes
0 references
incidence rings
0 references
directed graphs
0 references
