I have a question about completely regular codes. I know that each perfect code is a completely regular codes? Is it right? If it is right, I want to know the proof.

  • $\begingroup$ Yes it is correct. Try the thesis of Bill Martin, it has many relevant results. Alternately, it should be pretty easy to calculate the parameters for the equitable partition induced by the distance classes of a perfect code through counting. $\endgroup$ – Morgan Rodgers Apr 13 '16 at 15:22
  • $\begingroup$ @MorganRodgers Thanks. As I was not sure, I didn,t try to calculate the parameters. $\endgroup$ – 6-0 Apr 13 '16 at 15:54

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.