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.
Keywords
Get full access to this article
View all access options for this article.