On the minimum distance of combinatorial codes

A conjecture of V.C. Da Rocha (see Electron. Lett., vol.21, no.21, p.949-50, 1985) concerning the minimum distance of a class of combinatorial codes is proved.< >

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1990-07, Vol.36 (4), p.922-923
Main Authors: Tolhuizen, L., van Lint, J.H.
Format: Article
Language:English
Subjects:
Applied sciences
Block codes
Exact sciences and technology
Informatics
Information, signal and communications theory
Linear code
Polynomials
Telecommunications and information theory
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A conjecture of V.C. Da Rocha (see Electron. Lett., vol.21, no.21, p.949-50, 1985) concerning the minimum distance of a class of combinatorial codes is proved.< >
ISSN:0018-9448
1557-9654
DOI:10.1109/18.53759