Affiliations: Department of Computer Science, National University of Singapore, Lower Kent Ridge Road, Singapore 119260 {dingcs,lamky}@comp.nus.edu.sg | Department of Mathematics, National University of Singapore, Lower Kent Ridge Road, Singapore 119260 xingcp@math.nus.edu.sg
Note: [] Address for correspondence: Department of Computer Science, National University of Singapore, Lower Kent Ridge Road, Singapore 119260.
Note: [] Address for correspondence: Department of Mathematics, National University of Singapore, Lower Kent Ridge Road, Singapore 119260.
Abstract: In this paper we present a binary-tree approach to the construction of all binary duadic codes of length n = pm. We also calculate the number of binary duadic codes of length n = pm, where p ≡ +1 (mod 8) is a prime.
