{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T09:51:51Z","timestamp":1760521911339},"reference-count":154,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1972,1,1]],"date-time":"1972-01-01T00:00:00Z","timestamp":63072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":15173,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1972]]},"DOI":"10.1016\/0012-365x(72)90036-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"265-294","source":"Crossref","is-referenced-by-count":26,"title":["A survey of constructive coding theory, and a table of binary codes of highest known rate"],"prefix":"10.1016","volume":"3","author":[{"given":"N.J.A","family":"Sloane","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(72)90036-2_BIB1_1","first-page":"360","article-title":"Algebraic coding theory","author":"Berlekamp","year":"1968"},{"key":"10.1016\/0012-365X(72)90036-2_BIB1_2","first-page":"432","article-title":"Algebraic coding theory","author":"Berlekamp","year":"1968"},{"key":"10.1016\/0012-365X(72)90036-2_BIB2","first-page":"385","volume":"PGIT 10","author":"Calabi","year":"1964","journal-title":"On the minimal weight of binary group codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB3","first-page":"349","volume":"PGIT 13","author":"Cordaro","year":"1967","journal-title":"Optimum (n, 2) codes for small values of channel error probability"},{"key":"10.1016\/0012-365X(72)90036-2_BIB4","first-page":"359","volume":"PGIT 16","author":"Chen","year":"1970","journal-title":"Computer results on the minimum distance of some binary cyclic codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB5","first-page":"60","volume":"PGIT 5","author":"Fontaine","year":"1959","journal-title":"Group code equivalence and optimum codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB6","first-page":"657","article-title":"Notes on digital coding","volume":"37","author":"Golay","year":"1949","journal-title":"Proc. IRE"},{"key":"10.1016\/0012-365X(72)90036-2_BIB7","first-page":"23","volume":"PGIT 4","author":"Golay","year":"1954","journal-title":"Binary coding"},{"key":"10.1016\/0012-365X(72)90036-2_BIB8","first-page":"167","volume":"PGIT 14","author":"Goldman","year":"1968","journal-title":"The weight structure of some Bose-Chaudhuri codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB9","first-page":"24","article-title":"A new class of linear error-correcting codes","volume":"6","author":"Goppa","year":"1970","journal-title":"Prob. Pereda\u010di Inform."},{"key":"10.1016\/0012-365X(72)90036-2_BIB10","first-page":"147","volume":"BSTJ 29","author":"Hamming","year":"1950","journal-title":"Error detecting and error correcting codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB11","first-page":"292","volume":"PGIT 18","author":"Helgert","year":"1972","journal-title":"Srivastava codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB12","unstructured":"H.J. Helgert, personal communication."},{"key":"10.1016\/0012-365X(72)90036-2_BIB13","first-page":"459","volume":"PGIT 11","author":"Julin","year":"1965","journal-title":"Two improved block codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB14","first-page":"81","volume":"PGIT 15","author":"Karlin","year":"1969","journal-title":"New binary coding results by circulants"},{"key":"10.1016\/0012-365X(72)90036-2_BIB15","first-page":"408","volume":"PGIT 15","author":"Kasami","year":"1969","journal-title":"Some remarks on BCH bounds and minimum weights of binary primitive BCH codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB16","first-page":"807","volume":"PGIT 14","author":"Kasami","year":"1968","journal-title":"Polynomial codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB17","first-page":"182","volume":"IC 20","author":"Kerdock","year":"1972","journal-title":"A class of low-rate nonlinear codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB18","unstructured":"M. Karlin, personal communication."},{"key":"10.1016\/0012-365X(72)90036-2_BIB19","series-title":"Communication theory","first-page":"111","article-title":"Efficiency of noise reducing codes","author":"Laemmel","year":"1953"},{"key":"10.1016\/0012-365X(72)90036-2_BIB20","first-page":"166","article-title":"The application of Hadamard matrices to a problem in coding","volume":"5","author":"Levenshtein","year":"1964","journal-title":"Problems of Cybernetics"},{"key":"10.1016\/0012-365X(72)90036-2_BIB21","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1137\/0116111","article-title":"On the minimum distance of Bose-Chaudhuri-Hocquenghem codes","volume":"16","author":"Lum","year":"1968","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(72)90036-2_BIB22","first-page":"613","volume":"IC 11","author":"Nordstrom","year":"1967","journal-title":"An optimum nonlinear code"},{"key":"10.1016\/0012-365X(72)90036-2_BIB23_1","series-title":"Error-connecting codes","first-page":"71","author":"Peterson","year":"1961"},{"key":"10.1016\/0012-365X(72)90036-2_BIB23_2","series-title":"Error-connecting codes","first-page":"166","author":"Peterson","year":"1961"},{"key":"10.1016\/0012-365X(72)90036-2_BIB24","first-page":"147","volume":"IC 6","author":"Pless","year":"1963","journal-title":"Power moment identities on weight distributions in error correcting codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB25","first-page":"445","volume":"PGIT 6","author":"Plotkin","year":"1960","journal-title":"Binary codes with specified minimum distance"},{"key":"10.1016\/0012-365X(72)90036-2_BIB26","first-page":"378","volume":"IC 13","author":"Preparata","year":"1968","journal-title":"A class of optimum nonlinear double-error correcting codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB29","first-page":"717","volume":"PGIT 16","author":"Sloane","year":"1970","journal-title":"A new family of single-error correcting codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB30","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1111\/j.1749-6632.1970.tb56492.x","article-title":"A new family of nonlinear codes obtained from conference matrices","volume":"175","author":"Sloane","year":"1970","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/0012-365X(72)90036-2_BIB31","unstructured":"A new code."},{"key":"10.1016\/0012-365X(72)90036-2_BIB32","first-page":"503","volume":"PGIT 18","author":"Sloane","year":"1972","journal-title":"New binary codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB33","first-page":"587","volume":"PGIT 13","author":"Tokura","year":"1967","journal-title":"A search procedure for finding optimum group codes for the binary symmetric channel"},{"key":"10.1016\/0012-365X(72)90036-2_BIB34","first-page":"94","volume":"IC 9","author":"Wagner","year":"1966","journal-title":"A search technique for quasi-perfect codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB35","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0116016","article-title":"A new class of cyclic codes","volume":"16","author":"Anderson","year":"1968","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(72)90036-2_BIB36","series-title":"Sci. Rept. AFCRL-67-0365","article-title":"Research to develop the algebraic theory of codes","author":"Assmus","year":"1967"},{"key":"10.1016\/0012-365X(72)90036-2_BIB37","first-page":"122","volume":"JCT 6","author":"Assmus","year":"1969","journal-title":"New 5-designs"},{"key":"10.1016\/0012-365X(72)90036-2_BIB38","first-page":"205","article-title":"Some (3p, p) codes","volume":"68","author":"Assmus","year":"1969"},{"key":"10.1016\/0012-365X(72)90036-2_BIB39","unstructured":"L.D. Baumert and R.J. McEliece, Weights of irreducible cyclic codes, to appear."},{"key":"10.1016\/0012-365X(72)90036-2_BIB40","series-title":"Rate distortion theory","author":"Berger","year":"1971"},{"key":"10.1016\/0012-365X(72)90036-2_BIB41","series-title":"Proc. 6th Allerton Conf. on Circuit and Systems Theory","first-page":"161","article-title":"Weight enumeration theorems","author":"Berlekamp","year":"1968"},{"key":"10.1016\/0012-365X(72)90036-2_BIB42","first-page":"485","volume":"IC 17","author":"Berlekamp","year":"1970","journal-title":"The weight enumerators for certaim subcodes of the second order binary Reed-Muller codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB43","first-page":"969","volume":"BSTJ 49","author":"Berlekamp","year":"1970","journal-title":"Some mathematical properties of a scheme for reducing the bandwidth of motion pictures by Hadamard smearing"},{"key":"10.1016\/0012-365X(72)90036-2_BIB44","series-title":"A survey of coding theory for algebraists and combinatorialists","author":"Berlekamp","year":"1970"},{"key":"10.1016\/0012-365X(72)90036-2_BIB45","first-page":"40","volume":"IC 18","author":"Berlekamp","year":"1971","journal-title":"Coding theory and the Mathieu groups"},{"key":"10.1016\/0012-365X(72)90036-2_BIB46","first-page":"415","volume":"PGIT 18","author":"Berlekamp","year":"1972","journal-title":"Long primitive binary BCH codes have distance d ~ 2n ln R\u22121log n\u2026"},{"key":"10.1016\/0012-365X(72)90036-2_BIB47","first-page":"745","volume":"PGIT 16","author":"Berlekamp","year":"1970","journal-title":"Weight enumerator for second order Reed-Muller codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB48","first-page":"203","article-title":"Weight distributions of the cosets of the (32, 6) Reed-Muller code","volume":"18","author":"Berlekamp","year":"1972","journal-title":"PGIT"},{"key":"10.1016\/0012-365X(72)90036-2_BIB49","first-page":"409","volume":"18","author":"Berlekamp","year":"1972","journal-title":"Gleason's theorem on self dual codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB50","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01072842","article-title":"On the theory of group codes","volume":"3","author":"Berman","year":"1967","journal-title":"Cybernetics"},{"key":"10.1016\/0012-365X(72)90036-2_BIB51","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01119999","article-title":"Semisimple cyclic and abelian codes II","volume":"3","author":"Berman","year":"1967","journal-title":"Cybernetics"},{"key":"10.1016\/0012-365X(72)90036-2_BIB52_1","first-page":"68","volume":"IC 3","author":"Bose","year":"1960","journal-title":"On a class of error correcting binary group codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB52_2","first-page":"279","volume":"IC 3","author":"Bose","year":"1960","journal-title":"On a class of error correcting binary group codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB53","article-title":"A survey of error correcting techniques for data on telephone facilities","author":"Burton","year":"1970","journal-title":"Proc. Intern. Commun. Conf."},{"key":"10.1016\/0012-365X(72)90036-2_BIB54","series-title":"Rept. 1059","article-title":"Abelian codes","author":"Camion","year":"1970"},{"key":"10.1016\/0012-365X(72)90036-2_BIB55","first-page":"242","article-title":"The existence of arbitrarily long pseudo-cyclic codes that meet the Gilbert bound","author":"Chen","year":"1971","journal-title":"Proc. 5th Ann. Princeton Conf. Inform. Sci."},{"key":"10.1016\/0012-365X(72)90036-2_BIB56","first-page":"407","volume":"IC 15","author":"Chen","year":"1969","journal-title":"Some results on quasicyclic codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB57","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1112\/blms\/1.1.79","article-title":"A group of order 8,315,553.613,086,720,000","volume":"1","author":"Conway","year":"1969","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/0012-365X(72)90036-2_BIB58","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01389796","article-title":"A characterization of Leech's lattice","volume":"7","author":"Conway","year":"1969","journal-title":"Invent. Math."},{"key":"10.1016\/0012-365X(72)90036-2_BIB59","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF02576111","article-title":"On a new class of binary group codes","volume":"5","author":"Dagnino","year":"1968","journal-title":"Calcolo"},{"key":"10.1016\/0012-365X(72)90036-2_BIB60","first-page":"389","article-title":"Automorphisms of abelian codes","volume":"25","author":"Delsarte","year":"1970","journal-title":"Philips Res. Rept."},{"key":"10.1016\/0012-365X(72)90036-2_BIB61","first-page":"319","volume":"IC 18","author":"Delsarte","year":"1971","journal-title":"Majority logic decodable codes derived from finite inversive planes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB62","series-title":"Mimeo Ser. No. 600.27","article-title":"Irreducible binary cyclic codes of even dimension","author":"Delsarte","year":"1970"},{"key":"10.1016\/0012-365X(72)90036-2_BIB63","unstructured":"R.L. Dobrushin, Survey of Soviet research in information theory, to appear."},{"key":"10.1016\/0012-365X(72)90036-2_BIB64","first-page":"504","volume":"BSTJ 31","author":"Gilbert","year":"1952","journal-title":"A comparison of signaling alphabets"},{"key":"10.1016\/0012-365X(72)90036-2_BIB65","first-page":"140","article-title":"Weight polynomials of self-dual codes and the MacWilliams identities","author":"Gleason","year":"1970","journal-title":"Proc. Intern. Congr. Mathematicians"},{"key":"10.1016\/0012-365X(72)90036-2_BIB66","first-page":"242","volume":"PGIT 13","author":"Goethals","year":"1967","journal-title":"Factorization of cyclic codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB67","first-page":"178","volume":"JCT 11","author":"Goethals","year":"1971","journal-title":"On the Golay perfect binary code"},{"key":"10.1016\/0012-365X(72)90036-2_BIB68","article-title":"Some combinatorial aspects of coding theory","author":"Goethals","year":"1971","journal-title":"Proc. Combinat. Symp."},{"key":"10.1016\/0012-365X(72)90036-2_BIB69","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0012-365X(72)90025-8","article-title":"Nearly perfect binary codes","volume":"3","author":"Goethals","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(72)90036-2_BIB70","first-page":"273","volume":"PGIT 12","author":"Green","year":"1966","journal-title":"Two heuristic techniques for block-code construction (Abstract)"},{"key":"10.1016\/0012-365X(72)90036-2_BIB71","series-title":"Ph. D. Thesis","article-title":"On the minimum distance structure of cyclic codes and decoding beyond the BCH bound","author":"Hartmann","year":"1970"},{"key":"10.1016\/0012-365X(72)90036-2_BIB72","first-page":"439","volume":"PGIT 18","author":"Hartmann","year":"1972","journal-title":"A note on the minimum distance structure of cyclic codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB73","unstructured":"C.R.P. Hartmann, A generalization of the BCH bound, submitted to IC."},{"key":"10.1016\/0012-365X(72)90036-2_BIB74","first-page":"117","article-title":"On the weight structure of cyclic codes of composite length","author":"Hartmann","year":"1971","journal-title":"Proc. Fourth Hawaii Inter. Conf. System Sci."},{"key":"10.1016\/0012-365X(72)90036-2_BIB75","first-page":"307","volume":"PGIT 18","author":"Hartmann","year":"1972","journal-title":"A bound for cyclic codes of composite length"},{"key":"10.1016\/0012-365X(72)90036-2_BIB76","first-page":"402","volume":"PGIT 18","author":"Hartmann","year":"1972","journal-title":"Some results on the minimum distance structure of cyclic codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB77","article-title":"On minimal distance, shortest length, and greatest number of elements for binary group codes","volume":"6","author":"Hatcher","year":"1964"},{"key":"10.1016\/0012-365X(72)90036-2_BIB78","first-page":"147","volume":"2","author":"Hocquenghem","year":"1959","journal-title":"Codes correcteurs d'erreurs"},{"key":"10.1016\/0012-365X(72)90036-2_BIB79","first-page":"511","volume":"PGIT 16","author":"Hoffner","year":"1970","journal-title":"Circulant bases for cyclic codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB80","first-page":"584","volume":"PGIT 15","author":"Jelinek","year":"1969","journal-title":"Free encoding of memoryless time-discrete sources with a fidelity criterion"},{"key":"10.1016\/0012-365X(72)90036-2_BIB81","first-page":"466","volume":"PGIT 17","author":"Johnson","year":"1971","journal-title":"On upper bounds for unrestricted binary error-correcting codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB82","first-page":"797","volume":"PGIT 16","author":"Karlin","year":"1970","journal-title":"Decoding of circulant codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB83","unstructured":"M. Karlin, Weight\/moment relationships in (Q + E) circulants, unpublished."},{"key":"10.1016\/0012-365X(72)90036-2_BIB84","first-page":"814","volume":"PGIT 14","author":"Kasami","year":"1968","journal-title":"Some lower bounds on the minimum weight of cyclic codes of composite length"},{"key":"10.1016\/0012-365X(72)90036-2_BIB85","first-page":"174","volume":"PGIT 15","author":"Kasami","year":"1969","journal-title":"An upper bound on k\/n for affine-invariant codes with fixed d\/n"},{"key":"10.1016\/0012-365X(72)90036-2_BIB86","first-page":"369","volume":"IC 18","author":"Kasami","year":"1971","journal-title":"The weight enumerators for several classes of subcodes of the second order binary Reed-Muller codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB87","unstructured":"T. Kasami, Some results on the weight structure of Reed-Muller codes, to appear."},{"key":"10.1016\/0012-365X(72)90036-2_BIB88","first-page":"274","volume":"PGIT 12","author":"Kasami","year":"1966","journal-title":"Some results on weight distributions of BCH codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB89","first-page":"752","volume":"PGIT 16","author":"Kasami","year":"1970","journal-title":"On the weight structure of Reed-Muller codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB90","article-title":"On the weight distribution of Reed-Muller codes","author":"Kasami","year":"1971"},{"key":"10.1016\/0012-365X(72)90036-2_BIB91","first-page":"197","volume":"PGIT 15","author":"Kautz","year":"1969","journal-title":"A survey of progress in coding theory in the Soviet Union"},{"key":"10.1016\/0012-365X(72)90036-2_BIB92","first-page":"45","article-title":"Some properties of random group codes of large length","volume":"1","author":"Koshelev","year":"1965","journal-title":"Probl. Pereda\u010dy Inform."},{"key":"10.1016\/0012-365X(72)90036-2_BIB93","first-page":"413","article-title":"The correcting capacities of linear codes","volume":"14","author":"Kozlov","year":"1969","journal-title":"Soviet Physics - Doklady"},{"key":"10.1016\/0012-365X(72)90036-2_BIB94","doi-asserted-by":"crossref","first-page":"657","DOI":"10.4153\/CJM-1964-065-1","article-title":"Some sphere packings in higher space","volume":"16","author":"Leech","year":"1964","journal-title":"Can. J. Math."},{"key":"10.1016\/0012-365X(72)90036-2_BIB95","doi-asserted-by":"crossref","first-page":"251","DOI":"10.4153\/CJM-1967-017-0","article-title":"Notes on sphere packings","volume":"19","author":"Leech","year":"1967","journal-title":"Can. J. Math."},{"key":"10.1016\/0012-365X(72)90036-2_BIB96","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1090\/S0002-9904-1970-12533-2","article-title":"New sphere packings in dimensions 9\u201315","volume":"76","author":"Leech","year":"1970","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(72)90036-2_BIB97","first-page":"345","article-title":"New sphere packings in more than thirty-two dimensions","author":"Leech","year":"1970","journal-title":"Proc. second Chapel Hill Conference on Comb. Math."},{"key":"10.1016\/0012-365X(72)90036-2_BIB98","doi-asserted-by":"crossref","first-page":"718","DOI":"10.4153\/CJM-1971-081-3","article-title":"Sphere packing and error-correcting codes","volume":"23","author":"Leech","year":"1971","journal-title":"Can. J. Math"},{"key":"10.1016\/0012-365X(72)90036-2_BIB99","first-page":"66","article-title":"A hypothesis on Bose-Chaudhuri codes","volume":"4","author":"Leont'ev","year":"1968","journal-title":"Probl. Pereda\u010dy Inform."},{"key":"10.1016\/0012-365X(72)90036-2_BIB100","first-page":"445","volume":"IC 11","author":"Lin","year":"1967","journal-title":"Long BCH codes are bad"},{"key":"10.1016\/0012-365X(72)90036-2_BIB101","first-page":"245","article-title":"A construction scheme for linear and nonlinear codes","author":"Liu","year":"1971","journal-title":"Proc. 5th Ann. Princeton Conf. Inform. Sci."},{"key":"10.1016\/0012-365X(72)90036-2_BIB102","series-title":"Principles of data communication","author":"Lucky","year":"1968"},{"key":"10.1016\/0012-365X(72)90036-2_BIB103","series-title":"Error correcting codes","article-title":"Error-correcting codes \u2014 An historical survey","author":"MacWilliams","year":"1968"},{"key":"10.1016\/0012-365X(72)90036-2_BIB104","series-title":"Combinatorial mathematics and its applications","article-title":"Codes and ideals in group algebras","author":"MacWilliams","year":"1969"},{"key":"10.1016\/0012-365X(72)90036-2_BIB105","first-page":"987","volume":"BSTJ 49","author":"MacWilliams","year":"1970","journal-title":"Binary codes which are ideals in the group algebra of an abelian group"},{"key":"10.1016\/0012-365X(72)90036-2_BIB106","volume":"PGIT 18","author":"MacWilliams","year":"1972","journal-title":"Generalizations of Gleason's theorem on weight enumerators of self-dual codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB107","doi-asserted-by":"crossref","unstructured":"F.J. MacWilliams, N.J.A. Sloane and J.G. Thompson, On the existence of a projective plane of order 10, JCT, to appear.","DOI":"10.1016\/0097-3165(73)90064-2"},{"key":"10.1016\/0012-365X(72)90036-2_BIB108","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(72)90030-1","article-title":"Good self-dual codes exist","volume":"3","author":"MacWilliams","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(72)90036-2_BIB109","first-page":"8","article-title":"Summation of the product of codes","volume":"4","author":"Marchukov","year":"1968","journal-title":"Probl. Pereda\u010dy Inform."},{"key":"10.1016\/0012-365X(72)90036-2_BIB110","first-page":"609","volume":"PGIT 16","author":"McEliece","year":"1970","journal-title":"On the symmetry of good nonlinear codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB111_1","first-page":"22","article-title":"Euler products, cyclotomy, and coding","volume":"Vol. 37-65-III","author":"McEliece","year":"1970"},{"key":"10.1016\/0012-365X(72)90036-2_BIB111_2","first-page":"302","article-title":"Euler products, cyclotomy, and coding","volume":"4","author":"McEliece","year":"1972"},{"key":"10.1016\/0012-365X(72)90036-2_BIB112","first-page":"6","article-title":"Application of boolean algebra to switching circuit design and error detection","volume":"EC3","author":"Muller","year":"1954","journal-title":"IRE Trans. Electronic Computers"},{"key":"10.1016\/0012-365X(72)90036-2_BIB113","first-page":"58","volume":"PGIT 8","author":"Nadler","year":"1962","journal-title":"A 32-point n = 12, d = 5 code"},{"key":"10.1016\/0012-365X(72)90036-2_BIB114","first-page":"31","article-title":"Weight spectra for some classes of cyclic error-correcting codes","volume":"6","author":"Oganesyan","year":"1970","journal-title":"Probl. Pereda\u010di Inform."},{"key":"10.1016\/0012-365X(72)90036-2_BIB115","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1090\/S0025-5718-1958-0101641-5","article-title":"A search for analogues of the Mathieu groups","volume":"12","author":"Parker","year":"1958","journal-title":"Math. Corap."},{"key":"10.1016\/0012-365X(72)90036-2_BIB116","article-title":"Maximal codes with specified minimum distance","author":"Patel","year":"1969","journal-title":"IBM Tech. Rept. TR 44.0085"},{"key":"10.1016\/0012-365X(72)90036-2_BIB117","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1147\/rd.144.0434","article-title":"Maximal group codes with specified minimum distance","volume":"14","author":"Patel","year":"1970","journal-title":"IBM J. Res. Devel."},{"key":"10.1016\/0012-365X(72)90036-2_BIB118","first-page":"493","volume":"BSTJ 49","author":"Pehlert","year":"1970","journal-title":"Analysis of a burst-trapping error correction procedure"},{"key":"10.1016\/0012-365X(72)90036-2_BIB119","series-title":"Rept. AFCRL-65-515","article-title":"On the weight structure and symmetry of BCH codes","author":"Peterson","year":"1965"},{"key":"10.1016\/0012-365X(72)90036-2_BIB120","first-page":"215","volume":"JCT 5","author":"Pless","year":"1968","journal-title":"On the uniqueness of the Golay codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB121","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1090\/S0002-9904-1969-12418-3","article-title":"On a new family of symmetry codes and related new five-designs","volume":"75","author":"Pless","year":"1969","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/0012-365X(72)90036-2_BIB122","first-page":"119","volume":"JCT 12","author":"Pless","year":"1972","journal-title":"Symmetry codes over GF(3) and new five-designs"},{"key":"10.1016\/0012-365X(72)90036-2_BIB123","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(72)90034-9","article-title":"A classification of self-orthogonal codes over GF(2)","volume":"3","author":"Pless","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(72)90036-2_BIB124","first-page":"510","volume":"PGIT 16","author":"Preparata","year":"1970","journal-title":"A new look at the Golay (23, 12) code"},{"key":"10.1016\/0012-365X(72)90036-2_BIB125","year":"1971","journal-title":"Proc. Second Intern. Symp. Inform. theory"},{"key":"10.1016\/0012-365X(72)90036-2_BIB126","first-page":"38","volume":"PGIT 4","author":"Reed","year":"1954","journal-title":"A class of multiple-error correcting codes and the decoding scheme"},{"key":"10.1016\/0012-365X(72)90036-2_BIB127","unstructured":"D.V. Sarwate and E.R. Berlekamp, On the weight enumeration of Reed-Muller codes and their cosets, to appear."},{"key":"10.1016\/0012-365X(72)90036-2_BIB128","first-page":"77","article-title":"The complexity of decoders, II","volume":"PGIT 17","author":"Savage","year":"1971","journal-title":"Computational work and decoding time"},{"key":"10.1016\/0012-365X(72)90036-2_BIB129","first-page":"28","article-title":"Balanced codes and tactical configurations","volume":"5","author":"Semakov","year":"1969","journal-title":"Probl. Pereda\u010di Inform."},{"key":"10.1016\/0012-365X(72)90036-2_BIB130","first-page":"38","article-title":"Uniformly packed codes","volume":"7","author":"Semakov","year":"1971","journal-title":"Probl. Pereda\u010di Inform."},{"key":"10.1016\/0012-365X(72)90036-2_BIB131_1","first-page":"379","volume":"BSTJ 27","author":"Shannon","year":"1948","journal-title":"A mathematical theory of communication"},{"key":"10.1016\/0012-365X(72)90036-2_BIB131_2","first-page":"623","volume":"BSTJ 27","author":"Shannon","year":"1948","journal-title":"A mathematical theory of communication"},{"key":"10.1016\/0012-365X(72)90036-2_BIB132","doi-asserted-by":"crossref","first-page":"2162","DOI":"10.1109\/PROC.1967.6097","article-title":"Certain group codes","volume":"55","author":"Shiva","year":"1967","journal-title":"Proc. IEEE"},{"key":"10.1016\/0012-365X(72)90036-2_BIB133","first-page":"14","article-title":"Weight spectra of binary Bose-Chaudhuri-Hocquenghem codes","volume":"7","author":"Sidellnikov","year":"1971","journal-title":"Probl. Pereda\u010di Inform."},{"key":"10.1016\/0012-365X(72)90036-2_BIB134","first-page":"116","volume":"PGIT 10","author":"Singleton","year":"1964","journal-title":"Maximum distance Q-nary codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB135","series-title":"National Telemetering Conf. NTC'71 Record","first-page":"218","article-title":"A survey of recent results in constructive coding theory","author":"Sloane","year":"1971"},{"key":"10.1016\/0012-365X(72)90036-2_BIB136","first-page":"36.2","article-title":"On the enumeration of cosets of first order Reed-Muller codes","volume":"7","author":"Sloane","year":"1971","journal-title":"IEEE Intern. Conf. Communications"},{"key":"10.1016\/0012-365X(72)90036-2_BIB137","doi-asserted-by":"crossref","first-page":"164","DOI":"10.4153\/CJM-1951-021-6","article-title":"The Mathieu groups","volume":"3","author":"Stanton","year":"1951","journal-title":"Can. J. Math."},{"key":"10.1016\/0012-365X(72)90036-2_BIB138","series-title":"Theory of synchronous communications","author":"Stiffler","year":"1971"},{"key":"10.1016\/0012-365X(72)90036-2_BIB139","first-page":"627","volume":"PGIT 17","author":"Sugino","year":"1971","journal-title":"Weight distribution of (128, 64) Reed-Muller code"},{"key":"10.1016\/0012-365X(72)90036-2_BIB140","doi-asserted-by":"crossref","unstructured":"A. Tiet\u00e4v\u00e4inen, On the nonexistence of perfect codes over finite fields, SIAM J, to appear.","DOI":"10.1137\/0124010"},{"key":"10.1016\/0012-365X(72)90036-2_BIB141","first-page":"3","article-title":"There are no unknown perfect binary codes","volume":"AI 148","author":"Tiet\u00e4v\u00e4inen","year":"1971","journal-title":"Ann. Univ. Turku, Ser."},{"key":"10.1016\/0012-365X(72)90036-2_BIB142","first-page":"710","volume":"PGIT 15","author":"Tong","year":"1969","journal-title":"Burst-trapping techniques for a compound channel"},{"key":"10.1016\/0012-365X(72)90036-2_BIB143","first-page":"477","volume":"BSTJ 49","author":"Tong","year":"1970","journal-title":"Performance of burst-trapping codes"},{"key":"10.1016\/0012-365X(72)90036-2_BIB144","article-title":"Coding theory","volume":"201","author":"van Lint","year":"1971"},{"key":"10.1016\/0012-365X(72)90036-2_BIB145","unstructured":"J.H. van Lint, A survey of recent work on perfect codes, Rocky Mountain J. Math., to appear."},{"key":"10.1016\/0012-365X(72)90036-2_BIB146","unstructured":"J.H. van Lint, A new description of the Nadler code, PGIT to appear."},{"key":"10.1016\/0012-365X(72)90036-2_BIB147","article-title":"Weights in the third-order Reed-Muller codes","volume":"IV","author":"van Tilborg","year":"1971"},{"key":"10.1016\/0012-365X(72)90036-2_BIB148","first-page":"130","volume":"PGIT 16","author":"Weldon","year":"1970","journal-title":"Long quasi-cyclic codes are good (abstract)"},{"key":"10.1016\/0012-365X(72)90036-2_BIB149","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02948948","article-title":"\u00dcber Steinersche Systeme","volume":"12","author":"Witt","year":"1938","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0012-365X(72)90036-2_BIB150","first-page":"2405","volume":"BSTJ 48","author":"Wolf","year":"1969","journal-title":"Adding two information symbols to certain nonbinary BCH codes and some applications"},{"key":"10.1016\/0012-365X(72)90036-2_BIB151","first-page":"236","volume":"PGIT 16","author":"Wolf","year":"1970","journal-title":"Nonbinary random error-correcting codes"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X72900362?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X72900362?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T10:50:03Z","timestamp":1555152603000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X72900362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972]]},"references-count":154,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1972]]}},"alternative-id":["0012365X72900362"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(72)90036-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1972]]}}}