Sign Up to like & get
recommendations!
1
Published in 2022 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2021.3125277
Abstract: Diameter perfect codes form a natural generalization for perfect codes. They are based on the code-anticode bound which generalizes the sphere-packing bound. The code-anticode bound was proved by Delsarte for distance-regular graphs and it holds…
read more here.
Keywords:
diameter perfect;
weight codes;
non binary;
constant weight ... See more keywords