Minimum distances of error-correcting codes in incidence rings
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.
scientific article; zbMATH DE number 1883707