Optimal constant weight codes over Zk and generalized designs
Discrete Mathematics
Design of Balanced and Constant Weight Codes for VLSI Systems
IEEE Transactions on Computers
Binomial Moments of the Distance Distribution and the Probabilityof Undetected Error
Designs, Codes and Cryptography
Extended Binomial Moments of a Linear Code and the Undetected Error Probability
Problems of Information Transmission
A lower bound on the undetected error probability and strictly optimal codes
IEEE Transactions on Information Theory
Binary constant-weight codes for error detection
IEEE Transactions on Information Theory
Binomial moments of the distance distribution: bounds and applications
IEEE Transactions on Information Theory
The undetected error probability threshold of m-out-of-n codes
IEEE Transactions on Information Theory
Coding for tolerance and detection of skew in parallel asynchronous communications
IEEE Transactions on Information Theory
On the undetected error probability for binary codes
IEEE Transactions on Information Theory
The Probability of Undetected Error for Binary Constant-Weight Codes
IEEE Transactions on Information Theory
A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we introduce a new combinatorial invariant called q-binomial moment for q-ary constant weight codes. We derive a lower bound on the q-binomial moments and introduce a new combinatorial structure called generalized (s, t)-designs which could achieve the lower bounds. Moreover, we employ the q-binomial moments to study the undetected error probability of q-ary constant weight codes. A lower bound on the undetected error probability for q-ary constant weight codes is obtained. This lower bound extends and unifies the related results of Abdel-Ghaffar for q-ary codes and Xia-Fu-Ling for binary constant weight codes. Finally, some q-ary constant weight codes which achieve the lower bounds are found.