On the nonexistence of completely transitive codes

Completely transitive codes were introduced by P. Sole (1990) as a special case of binary linear completely regular codes. The existence of such codes is closely related to the existence of certain permutation groups. The nonexistence of highly transitive permutation groups allows us to prove the nonexistence of completely transitive codes with error-correcting capability greater than 4.

[1]  Lineu C. Barbosa.  Toward the detection of signals in presence of signal-dependent noise , 1995, Other Conferences.

[2]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[3]  V. V. Rykov,et al.  Superimposed distance codes , 1989 .

[4]  László Györfi,et al.  Constructions of binary constant-weight cyclic codes and cyclically permutable codes , 1992, IEEE Trans. Inf. Theory.

[5]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[6]  Aleksandar Kavcic.  Error probability bounds for nonlinear channels with intersymbol interference and signal-dependent correlated noise , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[7]  S. Haykin,et al.  Adaptive Filter Theory , 1986 .

[8]  Nikhil Balram,et al.  Recursive structure of noncausal Gauss-Markov random fields , 1992, IEEE Trans. Inf. Theory.

[9]  P. Cameron.  FINITE PERMUTATION GROUPS AND FINITE SIMPLE GROUPS , 1981 .

[10]  Jack K. Wolf,et al.  Improvements in detectors based upon colored noise , 1998 .

[11]  H. O. Posten.  Multidimensional Gaussian Distributions , 1964 .

[12]  Jian-Gang Zhu,et al.  Noise Characteristics of Interacting Transitions in Longitudinal Thin Film Media , 1994, Digest of the Magnetic Recording Conference.

[13]  Lennart Ljung,et al.  System Identification: Theory for the User , 1987 .

[14]  Arnold Neumaier,et al.  Completely regular codes , 1992, Discret. Math..

[15]  Patrick Solé.  Completely regular codes and completely transitive codes , 1990, Discret. Math..

[16]  O. Hudry.  R. L. Graham, M. Grötschel, L. Lovasz (sous la direction de), "Handbook of combinatorics", Amsterdam, North-Holland, 1995 (2 volumes) , 2000 .

[17]  Miklós Ruszinkó,et al.  On the upper bound of the size of the r -cover-free families , 1994 .

[18]  J. Moon,et al.  Modified viterbi algorithm for a jitter-dominant 1-D/sup 2/ channel , 1992, 1992. Digests of Intermag. International Magnetics Conference.

[19]  R. E. Kalman,et al.  New Results in Linear Filtering and Prediction Theory , 1961 .

[20]  Emanuel Knill,et al.  Non-adaptive Group Testing in the Presence of Errors , 1998, Discret. Appl. Math..

[21]  José M. F. Moura,et al.  Correlation-sensitive adaptive sequence detection , 1998 .

[22]  Cheryl E. Praeger,et al.  Completely Transitive Codes in Hamming Graphs , 1999, Eur. J. Comb..

[23]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[24]  José M. F. Moura,et al.  Matrices with banded inverses: Inversion algorithms and factorization of Gauss-Markov processes , 2000, IEEE Trans. Inf. Theory.

[25]  Ascher Wagner,et al.  Transitivity of finite permutation groups on unordered sets , 1965 .

[26]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[27]  Arkadii G. D'yachkov,et al.  Optimal superimposed codes and designs for Renyi's search model , 2002 .

[28]  Evangelos S. Eleftheriou,et al.  Noise-predictive maximum-likelihood (NPML) detection for the magnetic recording channel , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[29]  G. David Forney,et al.  Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.

[30]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[31]  A. Tietäväinen.  On the Nonexistence of Perfect Codes over Finite Fields , 1973 .

[32]  A. Patapoutian,et al.  Signal-dependent autoregressive channel model , 1999, IEEE International Magnetics Conference.

[33]  Arkadii G. D'yachkov,et al.  A survey of superimposed code theory , 1983 .

[34]  H. Mattson,et al.  The mathematical theory of coding , 1976, Proceedings of the IEEE.

[35]  Fady Alajaji,et al.  Detection of binary Markov sources over channels with additive Markov noise , 1996, IEEE Trans. Inf. Theory.

[36]  Evangelos S. Eleftheriou,et al.  Noise-predictive partial-response equalizers and applications , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[37]  Evangelos S. Eleftheriou,et al.  Noise-predictive maximum likelihood (NPML) detection , 1998 .

[38]  Hanfried Lenz,et al.  Design theory , 1985 .

[39]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[40]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[41]  van Hca Henk Tilborg,et al.  Uniformly packed codes , 1976 .

[42]  B. Anderson,et al.  Optimal Filtering , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[43]  J. Cioffi,et al.  Performance analysis of the modified maximum likelihood sequence detector in the presence of data-dependent noise , 1992, [1992] Conference Record of the Twenty-Sixth Asilomar Conference on Signals, Systems & Computers.

[44]  Arkadii G. D'yachkov,et al.  New Applications and Results of Superimposed Code Theory Arising from the Potentialities of Molecular Biology , 2000 .

[45]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[46]  Richard C. Singleton,et al.  Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.

[47]  Shahid U. H. Qureshi,et al.  Reduced-state sequence estimation with set partitioning and decision feedback , 1988, IEEE Trans. Commun..

[48]  Simon Haykin,et al.  Adaptive filter theory (2nd ed.) , 1991 .

[49]  A. Macula,et al.  On optimal parameters of a class of superimposed codes and designs , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[50]  Richard M. Wilson,et al.  On $t$-designs , 1975 .

[51]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[52]  G. David Forney.  Lower Bounds on Error Probability in the Presence of Large Intersymbol Interference , 1972, IEEE Trans. Commun..

[53]  M. Vedat Eyuboglu,et al.  Detection of coded modulation signals on linear, severely distorted channels using decision-feedback noise prediction with interleaving , 1988, IEEE Trans. Commun..