Please use this identifier to cite or link to this item:
|Title:||Construction and enumeration of all binary duadic codes of length pm||Authors:||Ding, C.
|Issue Date:||1999||Citation:||Ding, C.,Lam, K.Y.,Xing, C. (1999). Construction and enumeration of all binary duadic codes of length pm. Fundamenta Informaticae 38 (1-2) : 149-161. ScholarBank@NUS Repository.||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.||Source Title:||Fundamenta Informaticae||URI:||http://scholarbank.nus.edu.sg/handle/10635/43014||ISSN:||01692968|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 18, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.