Comments on "A note on perfect arithmetic codes

Antoine C. Lobstein · IEEE Transactions on Information Theory · 1988

J. Astola (ibid., vol. IT-32, p.443-5, May 1986) constructed new binary perfect arithmetic codes considering the modular distance introduced by T.R.N. Rao and O.N. Garcia (1971). The commenter states that, if the modular distance defined by W.E. Clark and J.J. Liang (1973) is considered, these codes are no longer perfect.>

Read the paper · More papers on PaperTik