Association schemes and coding theory
This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to coding theory (in a wide sense). It is mainly concerned with a class of subjects that involve the central notion of the distance distribution of a code. Special emphasis i...
Saved in:
| Published in: | IEEE transactions on information theory Vol. 44; no. 6; pp. 2477 - 2504 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.10.1998
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to coding theory (in a wide sense). It is mainly concerned with a class of subjects that involve the central notion of the distance distribution of a code. Special emphasis is put on the linear programming method, inspired by the MacWilliams transform. This produces upper bounds for the size of a code with a given minimum distance, and lower bounds for the size of a design with a given strength. The most specific results are obtained in the case where the underlying association scheme satisfies certain well-defined "polynomial properties;" this leads one into the realm of orthogonal polynomial theory. In particular, some "universal bounds" are derived for codes and designs in polynomial type association schemes. Throughout the paper, the main concepts, methods, and results are illustrated by two examples that are of major significance in classical coding theory, namely, the Hamming scheme and the Johnson scheme. Other topics that receive special attention are spherical codes and designs, and additive codes in translation schemes, including Z/sub 4/-additive binary codes. |
|---|---|
| AbstractList | This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to coding theory (in a wide sense). It is mainly concerned with a class of subjects that involve the central notion of the distance distribution of a code. Special emphasis is put on the linear programming method, inspired by the MacWilliams transform. This produces upper bounds for the size of a code with a given minimum distance, and lower bounds for the size of a design with a given strength. The most specific results are obtained in the case where the underlying association scheme satisfies certain well-defined "polynomial properties;" this leads one into the realm of orthogonal polynomial theory. In particular, some "universal bounds" are derived for codes and designs in polynomial type association schemes. Throughout the paper, the main concepts, methods, and results are illustrated by two examples that are of major significance in classical coding theory, namely, the Hamming scheme and the Johnson scheme. Other topics that receive special attention are spherical codes and designs, and additive codes in translation schemes, including Z/sub 4/-additive binary codes. This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to coding theory (in a wide sense). It is mainly concerned with a class of subjects that involve the central notion of the distance distribution of a code. This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to coding theory (in a wide sense). It is mainly concerned with a class of subjects that involve the central notion of the distance distribution of a code. Special emphasis is put on the linear programming method, inspired by the MacWilliams transform. This produces upper bounds for the size of a code with a given minimum distance, and lower bounds for the size of a design with a given strength. The most specific results are obtained in the case where the underlying association scheme satisfies certain well-defined "polynomial properties;" this leads one into the realm of orthogonal polynomial theory. In particular, some "universal bounds" are derived for codes and designs in polynomial type association schemes. Throughout the paper, the main concepts, methods, and results are illustrated by two examples that are of major significance in classical coding theory, namely, the Hamming scheme and the Johnson scheme. Other topics that receive special attention are spherical codes and designs, and additive codes in translation schemes, including Z(4)-additive binary codes |
| Author | Levenshtein, V.I. Delsarte, P. |
| Author_xml | – sequence: 1 givenname: P. surname: Delsarte fullname: Delsarte, P. organization: Dept. of Comput. Sci. & Eng., Catholic Univ. of Louvain, Belgium – sequence: 2 givenname: V.I. surname: Levenshtein fullname: Levenshtein, V.I. |
| BookMark | eNptkL1PwzAQxS1UJNrCwMoUIYHEkNafSTxWFV9SJRaYLce9UFepXexk6H-PIRVDxXR3ut-7e3oTNHLeAULXBM8IwXJOqllJseDiDI2JEGUuC8FHaIwxqXLJeXWBJjFu08gFoWN0t4jRG6s7610WzQZ2EDPt1pnxa-s-s24DPhwu0Xmj2whXxzpFH0-P78uXfPX2_LpcrHLDMO_ysmaUakmAaMqYSO8pCAK1NqJO5ipZ1g2X3NR1kdqCN7pkayErwQ3lhTZsiu6Hu_vgv3qIndrZaKBttQPfR0UrIRnHMoG3J-DW98Elb4pIIUnJBE_QwwCZ4GMM0Kh9sDsdDopg9ZOWIpUa0krs_IQ1tvtNpQvatv8qbgaFBYC_y8flNxpVczw |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1007_s40314_022_01872_9 crossref_primary_10_1109_TIT_2017_2723898 crossref_primary_10_1007_s12095_024_00709_y crossref_primary_10_1109_TIT_2023_3328262 crossref_primary_10_1007_s12190_020_01466_w crossref_primary_10_1007_s00373_017_1862_8 crossref_primary_10_1017_S0305004117000044 crossref_primary_10_1007_s41980_023_00842_z crossref_primary_10_1109_TIT_2014_2379644 crossref_primary_10_1109_TIT_2014_2359201 crossref_primary_10_1007_s10623_009_9316_9 crossref_primary_10_1007_s10623_017_0376_y crossref_primary_10_1109_TIT_2024_3476974 crossref_primary_10_1006_jcta_2002_3291 crossref_primary_10_1007_s12190_015_0964_9 crossref_primary_10_1016_j_ejc_2008_11_007 crossref_primary_10_12677_AAM_2022_128349 crossref_primary_10_1007_s10623_017_0407_8 crossref_primary_10_1016_j_ejc_2008_11_001 crossref_primary_10_1109_TIT_2021_3056319 crossref_primary_10_1016_j_disc_2010_04_007 crossref_primary_10_1016_j_disc_2024_114179 crossref_primary_10_1109_18_720549 crossref_primary_10_1016_j_disc_2007_07_081 crossref_primary_10_1016_j_ffa_2024_102568 crossref_primary_10_1016_j_laa_2020_07_009 crossref_primary_10_1134_S0032946018040026 crossref_primary_10_1007_s12095_019_00397_z crossref_primary_10_1007_s10623_019_00688_9 crossref_primary_10_1109_ACCESS_2024_3519440 crossref_primary_10_1016_j_disc_2017_07_008 crossref_primary_10_1007_s10623_010_9463_z crossref_primary_10_1109_TIT_2005_853313 crossref_primary_10_1109_TIT_2021_3057094 crossref_primary_10_1016_j_spa_2017_10_006 crossref_primary_10_1080_03081087_2014_952728 crossref_primary_10_1109_TIT_2008_928284 crossref_primary_10_1007_s10801_015_0595_0 crossref_primary_10_1007_s40314_024_02788_2 crossref_primary_10_1016_j_laa_2012_05_036 crossref_primary_10_1016_S0195_6698_03_00099_4 crossref_primary_10_1109_LCOMM_2017_2707406 crossref_primary_10_1016_j_aim_2015_04_026 crossref_primary_10_1137_S0895480100376496 crossref_primary_10_1016_j_endm_2013_05_032 crossref_primary_10_1007_s12095_022_00594_3 crossref_primary_10_1016_j_jcta_2021_105576 crossref_primary_10_1007_s11128_020_02825_z crossref_primary_10_1007_s00208_003_0440_y crossref_primary_10_1088_1742_5468_adba42 crossref_primary_10_1049_el_2014_4300 crossref_primary_10_1007_s00454_019_00123_9 crossref_primary_10_1016_j_disc_2023_113773 crossref_primary_10_1016_j_jcta_2010_05_006 crossref_primary_10_1016_j_physd_2021_133116 crossref_primary_10_1007_s00200_015_0273_4 crossref_primary_10_1142_S0219498818501360 crossref_primary_10_1007_s00373_020_02170_z crossref_primary_10_1109_TIT_2003_813483 crossref_primary_10_1016_j_ffa_2025_102592 crossref_primary_10_1007_s00200_017_0339_6 crossref_primary_10_1109_TIT_2023_3290416 crossref_primary_10_1007_s12095_019_00412_3 crossref_primary_10_1016_j_disc_2007_07_008 crossref_primary_10_2298_FIL2408899A crossref_primary_10_1007_s00224_023_10125_z crossref_primary_10_1007_s10623_010_9437_1 crossref_primary_10_1109_TIT_2023_3327759 crossref_primary_10_1109_TIT_2013_2270274 crossref_primary_10_1016_j_ffa_2021_101821 crossref_primary_10_1016_S0895_7177_03_90063_X crossref_primary_10_1007_s00041_022_09952_4 crossref_primary_10_1007_s00373_021_02338_1 crossref_primary_10_1007_s10623_017_0401_1 crossref_primary_10_1109_TIT_2011_2167739 crossref_primary_10_1007_s10623_014_9940_x crossref_primary_10_1109_TIT_2021_3089129 crossref_primary_10_1007_s10623_009_9340_9 crossref_primary_10_3390_math8111883 crossref_primary_10_1007_s00200_025_00693_7 crossref_primary_10_1007_s00373_021_02397_4 crossref_primary_10_1007_s12095_024_00737_8 crossref_primary_10_1109_TIT_2023_3276921 crossref_primary_10_1137_20M1369592 crossref_primary_10_1007_s10623_016_0323_3 crossref_primary_10_1109_TIT_2002_801474 crossref_primary_10_1007_s10623_015_0077_3 crossref_primary_10_1007_s10623_016_0286_4 crossref_primary_10_1007_s13324_019_00313_x crossref_primary_10_1109_TIT_2006_880063 crossref_primary_10_1007_s40995_025_01781_6 crossref_primary_10_1109_ACCESS_2022_3150426 crossref_primary_10_1109_TIT_2021_3128630 crossref_primary_10_1016_j_disc_2025_114459 |
| Cites_doi | 10.1002/j.1538-7305.1957.tb02410.x 10.1016/S0195-6698(85)80004-4 10.1007/BF01696200 10.1093/qmath/22.2.247 10.1080/01621459.1952.10501161 10.2307/2983576 10.1017/S2040618500033219 10.1090/conm/009/655979 10.1016/0012-365X(90)90002-Y 10.1002/j.1538-7305.1963.tb04003.x 10.1016/0012-365X(77)90158-3 10.1109/18.556115 10.1002/j.1538-7305.1959.tb03905.x 10.1007/3-540-48658-5_24 10.1109/TIT.1979.1055985 10.1307/mmj/1029002165 10.1109/18.59949 10.1007/BF00147398 10.1137/1016056 10.1007/BF03187604 10.1007/978-1-4612-5785-1_38 10.1016/0021-8693(67)90011-7 10.4153/CJM-1967-091-8 10.1023/A:1022429530062 10.1093/qmath/28.4.433 10.1512/iumj.1976.25.25030 10.1109/18.243438 10.1109/TIT.1983.1056681 10.1023/A:1008260505585 10.1006/eujc.1996.0022 10.1137/0510092 10.1016/S0195-6698(80)80050-3 10.1017/CBO9780511566066 10.1007/BF01162390 10.1016/0012-365X(72)90028-3 10.1109/TIT.1956.1056798 10.1109/TIT.1984.1056949 10.1016/S0021-9800(69)80115-8 10.1007/978-94-009-0501-6_2 10.1016/S0195-6698(89)80048-4 10.1007/978-3-642-74341-2 10.1007/BF01787700 10.4153/CJM-1999-017-5 10.1007/BF02122684 10.1016/0378-3758(79)90001-6 10.1109/18.532903 10.1109/18.412678 10.1016/S0195-6698(85)80039-1 10.1007/BF00053379 10.1109/TIT.1977.1055688 10.1109/18.21257 10.1016/S0019-9958(73)80007-5 10.1109/18.133244 10.1017/CBO9780511608704 10.1016/S0019-9958(67)90052-6 10.1109/TIT.1974.1055279 10.1109/18.312154 10.1007/978-94-010-9787-1_2 10.1007/BF01788104 10.1137/0134012 10.1090/mmono/022 10.1109/TIT.1985.1057043 10.1023/A:1008207230165 10.1017/CBO9780511662133.007 10.1109/18.75248 10.1070/SM1974v024n01ABEH001911 10.1017/CBO9781316529836 10.1109/TIT.1979.1056072 10.1016/S0195-6698(82)80035-8 10.1007/978-94-009-0501-6_19 10.1007/978-3-662-39641-4_5 10.2140/pjm.1963.13.389 10.1016/0024-3795(82)90028-3 10.1017/CBO9780511662089.010 10.1090/pspum/034/525324 10.2307/1969427 10.1070/im1997v061n03ABEH000132 10.1214/aoms/1177706356 10.1109/18.212301 10.1007/BF01454863 10.1016/B978-0-12-064850-4.50009-4 10.1109/18.42182 10.1137/0513044 10.1016/S0012-365X(98)00259-3 |
| ContentType | Journal Article |
| Copyright | Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 1998 |
| Copyright_xml | – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 1998 |
| DBID | RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/18.720545 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1557-9654 |
| EndPage | 2504 |
| ExternalDocumentID | 36115313 10_1109_18_720545 720545 |
| Genre | Feature |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D RIG |
| ID | FETCH-LOGICAL-c304t-7b322a91e1a23355572e51ebac5b109897bf494cbb697b64fa73d59854c246ac3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 151 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000076437400017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9448 |
| IngestDate | Sun Sep 28 10:48:36 EDT 2025 Fri Jul 25 06:50:06 EDT 2025 Sat Nov 29 02:54:43 EST 2025 Tue Nov 18 22:35:13 EST 2025 Tue Aug 26 21:00:16 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c304t-7b322a91e1a23355572e51ebac5b109897bf494cbb697b64fa73d59854c246ac3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 195917354 |
| PQPubID | 36024 |
| PageCount | 28 |
| ParticipantIDs | crossref_primary_10_1109_18_720545 proquest_miscellaneous_28593409 ieee_primary_720545 crossref_citationtrail_10_1109_18_720545 proquest_journals_195917354 |
| PublicationCentury | 1900 |
| PublicationDate | 1998-10-01 |
| PublicationDateYYYYMMDD | 1998-10-01 |
| PublicationDate_xml | – month: 10 year: 1998 text: 1998-10-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 1998 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref57 ref56 ref59 ref58 ref55 wilson (ref134) 1984 slater (ref114) 1966 camion (ref33) 1991 delsarte (ref41) 1978; 25 macwilliams (ref88) 1977 van lint (ref82) 1982 terwilliger (ref126) 1987; 45 ref50 sidelnikov (ref111) 1974; 10 sidelnikov (ref112) 1980; 16 ref45 ref48 ref47 delsarte (ref39) 1977; 32 ref8 ref7 delsarte (ref35) 1972; 27 levenshtein (ref76) 1983; 40 beth (ref15) 1985 ref9 hoheisel (ref61) 1939; 48 ref4 ref6 ref5 gabidulin (ref52) 1985; 21 leonard (ref72) 1984 roos (ref101) 1979; 4 ref34 assmus jr (ref3) 1992 rodemich (ref100) 1980 ref36 ref31 dunkl (ref46) 1976; 25 calderbank (ref30) 1985; 6 bannai (ref10) 1984 nechaev (ref92) 1989; 1 sidelnikov (ref110) 1974; 24 kabatyanskii (ref65) 1978; 14 mceliece (ref91) 1978; 3 ref24 ref23 ref26 ref20 ref22 ref21 delsarte (ref37) 1973; 10 tamaschke (ref123) 1963; 80 ref27 sidelnikov (ref109) 1971; 12 ref29 erde´lyi (ref49) 1953; 2 hoggar (ref60) 1982; 3 calderbank (ref28) 1993; 338 belevitch (ref13) 1968; 82 vilenkin (ref129) 1968 tarnanen (ref124) 1982; 182 ref128 godsil (ref54) 1993 gangolli (ref53) 1967; 3 ref14 schrijver (ref104) 1979; it 25 ref97 ref127 delsarte (ref42) 1994 ref11 ref125 ref98 szego (ref121) 1959 odlyzko (ref96) 1979; 26 ray-chaudhuri (ref99) 1975; 12 ref16 ref19 ref18 wilson (ref133) 1983; 34 askey (ref2) 1979; 10 bassalygo (ref12) 1965; 1 ref131 ref95 delsarte (ref38) 1976; 20 ref130 ref90 ref89 ref85 ref135 ref136 ref87 levenshtein (ref75) 1982; 25 biggs (ref17) 1973; 15 ref81 ref84 ref83 neumaier (ref94) 1980 ref80 ref108 ref78 delsarte (ref43) 1975; 19 ref106 ref107 ref105 ref77 levenshtein (ref74) 1979; 20 ref102 delsarte (ref40) 1978; 34 ref103 ref1 wielandt (ref132) 1964 levenshtein (ref73) 1978 camion (ref32) 1998 ref71 ref70 neumaier (ref93) 1980; 1 levenshtein (ref79) 1997; 12 karlin (ref66) 1961; 26 ref119 ref117 ref69 ref118 boyvalenkov (ref25) 0 ref64 ref115 ref63 ref116 ref113 macwilliams (ref86) 1962 kawada (ref67) 1942; 24 delsarte (ref44) 1975; 30 krawtchouk (ref68) 1929; 189 ref122 fazekas (ref51) 1995; 70 ref62 ref120 |
| References_xml | – volume: 16 start-page: 174 year: 1980 ident: ref112 article-title: extremal polynomials used in bounds of code volume publication-title: Probl Inform Transm – ident: ref84 doi: 10.1002/j.1538-7305.1957.tb02410.x – volume: 6 start-page: 133 year: 1985 ident: ref30 article-title: on a pair of dual subschemes of the hamming scheme $h_n(q)$ publication-title: Europ J Comb doi: 10.1016/S0195-6698(85)80004-4 – year: 1980 ident: ref94 publication-title: Combinatorial configurations in terms of distances – volume: 48 start-page: 448 year: 1939 ident: ref61 article-title: u¨ber charaktere publication-title: Monatsch Math Phys doi: 10.1007/BF01696200 – ident: ref128 doi: 10.1093/qmath/22.2.247 – ident: ref23 doi: 10.1080/01621459.1952.10501161 – ident: ref98 doi: 10.2307/2983576 – ident: ref97 doi: 10.1017/S2040618500033219 – ident: ref116 doi: 10.1090/conm/009/655979 – ident: ref1 doi: 10.1016/0012-365X(90)90002-Y – year: 1959 ident: ref121 publication-title: Orthogonal Polynomials – ident: ref87 doi: 10.1002/j.1538-7305.1963.tb04003.x – ident: ref14 doi: 10.1016/0012-365X(77)90158-3 – volume: 338 start-page: 941 year: 1993 ident: ref28 article-title: extending the $t$-design concept publication-title: Trans Amer Math Soc – ident: ref136 doi: 10.1109/18.556115 – start-page: 9 year: 1994 ident: ref42 article-title: application and generalization of the macwilliams transform in coding theory publication-title: Proc 15th Symp Information Theory in the Benelux – year: 1964 ident: ref132 publication-title: Finite Permutation Groups – ident: ref107 doi: 10.1002/j.1538-7305.1959.tb03905.x – year: 1962 ident: ref86 publication-title: Combinatorial problems of elementary group theory – ident: ref16 doi: 10.1007/3-540-48658-5_24 – year: 1985 ident: ref15 publication-title: Design Theory – volume: 70 start-page: 267 year: 1995 ident: ref51 publication-title: On upper bounds for code distance and covering radius of designs in polynomial metric spaces – ident: ref85 doi: 10.1109/TIT.1979.1055985 – ident: ref47 doi: 10.1307/mmj/1029002165 – ident: ref127 doi: 10.1109/18.59949 – ident: ref59 doi: 10.1007/BF00147398 – ident: ref5 doi: 10.1137/1016056 – ident: ref45 doi: 10.1007/BF03187604 – ident: ref103 doi: 10.1007/978-1-4612-5785-1_38 – ident: ref58 doi: 10.1016/0021-8693(67)90011-7 – ident: ref56 doi: 10.4153/CJM-1967-091-8 – volume: 10 year: 1973 ident: ref37 article-title: an algebraic approach to the association schemes of coding theory publication-title: Philips Res Repts Suppl – volume: 24 start-page: 97 year: 1942 ident: ref67 article-title: u¨ber den dualita¨tssatz der charaktere nichtcommutativer gruppen publication-title: Proc Phys Math Soc Japan (3) – year: 1993 ident: ref54 publication-title: J Algebraic Combinatorics – year: 1977 ident: ref88 publication-title: The Theory of Error-Correcting Codes – volume: 25 start-page: 226 year: 1978 ident: ref41 publication-title: Bilinear forms over a finite field with applications to coding theory – ident: ref63 doi: 10.1023/A:1022429530062 – volume: 27 start-page: 272 year: 1972 ident: ref35 article-title: bounds for unrestricted codes, by linear programming publication-title: Philips Res Repts – ident: ref7 doi: 10.1093/qmath/28.4.433 – year: 1966 ident: ref114 publication-title: Generalized Hypergeometric Functions – volume: 25 start-page: 335 year: 1976 ident: ref46 article-title: a krawtchouk polynomial addition theorem and wreath products of symmetric groups publication-title: Indiana Univ J Mathematics doi: 10.1512/iumj.1976.25.25030 – volume: 182 year: 1982 ident: ref124 publication-title: An approach to construct constant weight and Lee codes by using the method of association schemes – volume: 10 start-page: 124 year: 1974 ident: ref111 article-title: upper bounds on the number of points of a binary code with a specified code distance publication-title: Probl Inform Transm – ident: ref118 doi: 10.1109/18.243438 – ident: ref6 doi: 10.1109/TIT.1983.1056681 – ident: ref69 doi: 10.1023/A:1008260505585 – ident: ref83 doi: 10.1006/eujc.1996.0022 – volume: 45 start-page: 8 year: 1987 ident: ref126 publication-title: A characterization of $P$ - and $Q$ -polynomial association schemes – volume: 34 start-page: 313 year: 1983 ident: ref133 publication-title: Inequalities for $t$ -designs – volume: 10 start-page: 1008 year: 1979 ident: ref2 article-title: a set of orthogonal polynomials that generalize the racah coefficients or $6 - j$ symbols publication-title: SIAM J Math Anal doi: 10.1137/0510092 – volume: 1 start-page: 163 year: 1980 ident: ref93 article-title: distances, graphs and designs publication-title: Europ J Combin doi: 10.1016/S0195-6698(80)80050-3 – ident: ref62 doi: 10.1017/CBO9780511566066 – volume: 80 start-page: 328 year: 1963 ident: ref123 article-title: zur theorie der permutationsgruppen mit regula¨rer untergruppe i publication-title: Math Z doi: 10.1007/BF01162390 – volume: 30 start-page: 91 year: 1975 ident: ref44 article-title: bounds for systems of lines, and jacobi polynomials publication-title: Philips Res Repts – ident: ref70 doi: 10.1016/0012-365X(72)90028-3 – ident: ref106 doi: 10.1109/TIT.1956.1056798 – volume: 20 start-page: 230 year: 1976 ident: ref38 publication-title: Association schemes and $t$ -designs in regular semilattices – volume: 82 start-page: 13 year: 1968 ident: ref13 article-title: conference networks and hadamard matrices publication-title: Ann Soc Scient Bruxelles – volume: 14 start-page: 1 year: 1978 ident: ref65 article-title: bounds for packings on a sphere and in space publication-title: Probl Inform Transm – volume: 26 start-page: 33 year: 1961 ident: ref66 article-title: the hahn polynomials, formulas and an application publication-title: Scripta Math – ident: ref113 doi: 10.1109/TIT.1984.1056949 – ident: ref4 doi: 10.1016/S0021-9800(69)80115-8 – ident: ref9 doi: 10.1007/978-94-009-0501-6_2 – ident: ref117 doi: 10.1016/S0195-6698(89)80048-4 – volume: 32 start-page: 373 year: 1977 ident: ref39 article-title: pairs of vectors in the space of an association scheme publication-title: Philips Res Repts – volume: 3 start-page: 134 year: 1978 ident: ref91 article-title: the lova´sz bound and some generalizations publication-title: J Comb Inform Syst Sci – ident: ref26 doi: 10.1007/978-3-642-74341-2 – ident: ref50 doi: 10.1007/BF01787700 – volume: 189 start-page: 620 year: 1929 ident: ref68 article-title: sur une ge´ne´ralisation des polynoˆmes d'hermite publication-title: C R Acad Sci Paris – ident: ref89 doi: 10.4153/CJM-1999-017-5 – ident: ref95 doi: 10.1007/BF02122684 – start-page: 277 year: 1984 ident: ref72 article-title: metric, co-metric association schemes publication-title: Combinatorics Graph Theory and Computing Proc 15th Southeast Conf – ident: ref22 doi: 10.1016/0378-3758(79)90001-6 – volume: 19 start-page: 26 year: 1975 ident: ref43 publication-title: Alternating bilinear forms over $\hbox GF \ (q)$ – ident: ref24 doi: 10.1109/18.532903 – volume: 3 start-page: 121 year: 1967 ident: ref53 article-title: positive definite kernels on homogeneous spaces and certain stochastic processes related to levy's brownian motion of several parameters publication-title: Ann Inst Henri Poincare´ – volume: 20 start-page: 417 year: 1979 ident: ref74 article-title: on bounds for packings in $n$-dimensional euclidean space publication-title: Sov Math – Dokl – ident: ref81 doi: 10.1109/18.412678 – ident: ref125 doi: 10.1016/S0195-6698(85)80039-1 – volume: 21 start-page: 1 year: 1985 ident: ref52 article-title: theory of codes with maximum rank distance publication-title: Probl Inform Transm – ident: ref77 doi: 10.1007/BF00053379 – ident: ref90 doi: 10.1109/TIT.1977.1055688 – start-page: 86 year: 1991 ident: ref33 article-title: on correlation-immune functions publication-title: Advances in Cryptology– CRYPTO 91 – ident: ref31 doi: 10.1109/18.21257 – ident: ref36 doi: 10.1016/S0019-9958(73)80007-5 – ident: ref29 doi: 10.1109/18.133244 – ident: ref18 doi: 10.1017/CBO9780511608704 – ident: ref108 doi: 10.1016/S0019-9958(67)90052-6 – year: 1984 ident: ref10 publication-title: Algebraic Combinatorics I Association Schemes – ident: ref131 doi: 10.1109/TIT.1974.1055279 – ident: ref57 doi: 10.1109/18.312154 – volume: 26 start-page: 210 year: 1979 ident: ref96 publication-title: New bounds on the number of unit spheres that can touch a unit sphere in $n$ dimensions – ident: ref119 doi: 10.1007/978-94-010-9787-1_2 – ident: ref11 doi: 10.1007/BF01788104 – volume: 34 start-page: 157 year: 1978 ident: ref40 article-title: hahn polynomials, discrete harmonics, and $t$-designs publication-title: SIAM J Appl Math doi: 10.1137/0134012 – start-page: 103 year: 1978 ident: ref73 article-title: on choosing polynomials to obtain bounds in packing problems publication-title: Proc 7th All-Union Conf Coding Theory and Information Transmission – year: 1968 ident: ref129 publication-title: Special Functions and the Theory of Group Representation doi: 10.1090/mmono/022 – volume: 1 start-page: 123 year: 1989 ident: ref92 article-title: the kerdock code in a cyclic form publication-title: Diskret Math – volume: 15 start-page: 289 year: 1973 ident: ref17 publication-title: Perfect codes in graphs – volume: 40 start-page: 43 year: 1983 ident: ref76 article-title: bounds for packings of metric spaces and some of their applications publication-title: Probl Cybern – ident: ref34 doi: 10.1109/TIT.1985.1057043 – volume: 12 start-page: 131 year: 1997 ident: ref79 article-title: split orthogonal arrays and maximum independent resilient systems of functions publication-title: Des Codes Cryptogr doi: 10.1023/A:1008207230165 – ident: ref105 doi: 10.1017/CBO9780511662133.007 – ident: ref102 doi: 10.1109/18.75248 – volume: 24 start-page: 147 year: 1974 ident: ref110 article-title: new bounds for densest packings of spheres in $n$-dimensional euclidean space publication-title: Math USSR Sbornik doi: 10.1070/SM1974v024n01ABEH001911 – year: 1992 ident: ref3 publication-title: Designs and their Codes doi: 10.1017/CBO9781316529836 – volume: it 25 start-page: 425 year: 1979 ident: ref104 article-title: a comparison of the bounds of delsarte and lova´sz publication-title: IEEE Trans Information Theory doi: 10.1109/TIT.1979.1056072 – year: 1998 ident: ref32 article-title: codes and association schemes publication-title: Handbook of Coding Theory – volume: 3 start-page: 233 year: 1982 ident: ref60 article-title: $t$-designs in projective spaces publication-title: Europ J Combin doi: 10.1016/S0195-6698(82)80035-8 – volume: 12 start-page: 197 year: 1971 ident: ref109 article-title: on mutual correlation of sequences publication-title: Sov Math – Dokl – volume: 12 start-page: 737 year: 1975 ident: ref99 article-title: on $t$-designs publication-title: Osaka J Math – ident: ref120 doi: 10.1007/978-94-009-0501-6_19 – ident: ref55 doi: 10.1007/978-3-662-39641-4_5 – ident: ref78 doi: 10.1109/18.412678 – ident: ref20 doi: 10.2140/pjm.1963.13.389 – year: 1980 ident: ref100 article-title: an inequality in coding theory publication-title: Annu Amer Math Soc Meet – ident: ref8 doi: 10.1016/0024-3795(82)90028-3 – ident: ref122 doi: 10.1017/CBO9780511662089.010 – ident: ref48 doi: 10.1090/pspum/034/525324 – volume: 1 start-page: 32 year: 1965 ident: ref12 article-title: new upper bounds for error correcting codes publication-title: Probl Inform Transm – ident: ref130 doi: 10.2307/1969427 – ident: ref135 doi: 10.1070/im1997v061n03ABEH000132 – ident: ref21 doi: 10.1214/aoms/1177706356 – volume: 25 start-page: 526 year: 1982 ident: ref75 article-title: bounds on the maximal cardinality of a code with bounded modulus of the inner product publication-title: Sov Math – Dokl – ident: ref27 doi: 10.1109/18.212301 – start-page: 19 year: 1984 ident: ref134 article-title: on the theory of $t$-designs publication-title: Enumeration and Designs – volume: 2 year: 1953 ident: ref49 publication-title: Higher Transcendental Functions – ident: ref19 doi: 10.1007/BF01454863 – ident: ref115 doi: 10.1016/B978-0-12-064850-4.50009-4 – ident: ref64 doi: 10.1109/18.42182 – volume: 4 start-page: 191 year: 1979 ident: ref101 article-title: on metric and cometric association schemes publication-title: Delft Progr Rep – year: 0 ident: ref25 article-title: on linear programming bounds for codes in polynomial metric spaces publication-title: Probl Inform Transm – year: 1982 ident: ref82 publication-title: Coding Theory – ident: ref71 doi: 10.1137/0513044 – ident: ref80 doi: 10.1016/S0012-365X(98)00259-3 |
| SSID | ssj0014512 |
| Score | 2.0466356 |
| Snippet | This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to coding theory (in a wide... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 2477 |
| SubjectTerms | Algebra Associate members Binary codes Codes Combinatorial mathematics Extraterrestrial measurements Indium tin oxide Linear programming Polynomials Research and development Theory Upper bound |
| Title | Association schemes and coding theory |
| URI | https://ieeexplore.ieee.org/document/720545 https://www.proquest.com/docview/195917354 https://www.proquest.com/docview/28593409 |
| Volume | 44 |
| WOSCitedRecordID | wos000076437400017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH-44UEPTqfinB9FFLx0S5qkaY4iDg8yPCjsVpI0BUE7WTfB_94k_WDiLt5Cm5b2vb6-9_Ly-z2Aa5Zn2LGwhMw4Um0pqbU5FodZVkEpY4o8UPiJT6fJbCaea55tj4UxxvjNZ2bkhr6Wn831yi2VjXlkAwzWgQ7ncQXVagsGlOGKGBxb-7UpR00ihJEY42RUXfjL9fheKn9-wN6rTHr_ep592KuDx-Cu0vYBbJmiD72mMUNQ22kfdtdYBg_hZk0FgU1mzYcpA1lkgZ47xxV4LOP3EbxOHl7uH8O6O0KoCaLLkCtri1Jgg2VEbNTAeGQYNkpqpuxrJ4KrnAqqlYrtMKa55CRjImFURzSWmhxDt5gX5gQClJHExCjHLCFUKiYYMooqpHIulCRoALeN4FJdU4e7DhbvqU8hkEhxklbCGMBVO_Wz4svYNKnvhNlOaI4OG2WktSGVqeO-wZwwOoDL9qy1AFfWkIWZr8rUUfARm6aebrzrEHY8jNDvvzuD7nKxMuewrb-Wb-Xiwn9EP0kowyo |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS8MwED50CuqD06k4p66Igi_dkiZpm0cRx8Q5fJiwt5KkKQjayX4I_vcmaTsm7sW30Kalvev17nL5vgO4ZlmKLQuLz7Ql1RaCGptjoZ-mBZQypMgBhQfRcBiPx_yl5Nl2WBittdt8pjt26Gr56UQt7FJZNwpMgME2Ycs2zirBWsuSAWW4oAbHxoJN0lHSCGHEuzjuFJf-cj6um8qfX7DzK736v57oAPbL8NG7K_R9CBs6b0C9as3glZbagL0VnsEjuFlRgmfSWf2hZ57IU09NrOvyHJrx-xheew-j-75f9kfwFUF07kfSWKPgWGMREBM3sCjQDGspFJPmtWMeyYxyqqQMzTCkmYhIynjMqApoKBQ5gVo-yfUpeCglsQ5RhllMqJCMM6QllUhmEZeCoCbcVoJLVEkebntYvCcuiUA8wXFSCKMJV8upnwVjxrpJDSvM5YTqaKtSRlKa0iyx7Dc4Iow2ob08a2zAFjZErieLWWJJ-IhJVM_W3rUNO_3R8yAZPA6fWrDrQIVuN9451ObThb6AbfU1f5tNL90H9QOfEMZz |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Association+schemes+and+coding+theory&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Delsarte%2C+Philippe&rft.au=Levenshtein%2C+Vladimir+I&rft.date=1998-10-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=44&rft.issue=6&rft.spage=2477&rft_id=info:doi/10.1109%2F18.720545&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=36115313 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |