Optimal codes for minimax criterion on error detection
- 1 January 1989
- journal article
- letter
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (6), 1299-1305
- https://doi.org/10.1109/18.45288
Abstract
Nonlinear quadratic codes that are optimal for the minimax error detection are presented. Characteristic functions for these codes are asymptotically bent. For a given block size n and the number of codewords |C|, these codes minimize max Q(e), e≠0, where Q(e) is the conditional error-masking probability, given the error pattern e. The codewords are blocks of n symbols from GF(q). Encoding and decoding procedures for the codes are describedKeywords
This publication has 8 references indexed in Scilit:
- Statistical and computational performance of a class of generalized Wiener filters (Corresp.)IEEE Transactions on Information Theory, 1986
- Design of universal test sequences for VLSIIEEE Transactions on Information Theory, 1985
- Minimax Robust Discrete-Time Matched FiltersIEEE Transactions on Communications, 1983
- Maximal families of bent sequencesIEEE Transactions on Information Theory, 1982
- Bent-function sequencesIEEE Transactions on Information Theory, 1982
- Measures of the Effectiveness of Fault Signature AnalysisIEEE Transactions on Computers, 1980
- On “bent” functionsJournal of Combinatorial Theory, Series A, 1976
- A family of difference sets in non-cyclic groupsJournal of Combinatorial Theory, Series A, 1973