Construction and Enumeration of All Binary Duadic Codes of Length p m

  • Authors:

  • Cunsheng Ding;Kwok Yan Lam;Chaoping Xing

  • Affiliations:

  • Department of Computer Science, National University of Singapore, Lower Kent Ridge Road, Singapore 119260 {dingcs,lamky}@comp.nus.edu.sg;(Correspd.) Department of Computer Science, National University of Singapore, Lower Kent Ridge Road, Singapore 119260 {dingcs,lamky}@comp.nus.edu.sg;(Correspd.) Department of Mathematics, National University of Singapore, Lower Kent Ridge Road, Singapore 119260 xingcp@math.nus.edu.sg

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a binary-tree approach to the construction of all binary duadic codes of length n = p m. We also calculate the number of binary duadic codes of length n = p m, where p ≡ +1 (mod 8) is a prime.