On the non-existence of perfect and nearly perfect codes


Let [k], = b denote the number of vcrtioes in r at distance j f~ozn a particular vertex of r(OSSd). In the next section we state some preliminary results ap? In Section 3 we prove the main result of the paper. The objective is to e%r>lish a purely combinatorial proof for the non-existence of certain completely regdar codes in the subclass of distance… (More)
DOI: 10.1016/0012-365X(82)90045-0


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics