LEADER 05753nam 22005895 450 001 9910789216903321 005 20210916100422.0 010 $a3-662-00174-8 024 7 $a10.1007/978-3-662-00174-5 035 $a(CKB)3400000000110397 035 $a(SSID)ssj0001297191 035 $a(PQKBManifestationID)11843372 035 $a(PQKBTitleCode)TC0001297191 035 $a(PQKBWorkID)11362251 035 $a(PQKB)11761355 035 $a(DE-He213)978-3-662-00174-5 035 $a(MiAaPQ)EBC3098533 035 $a(PPN)237975637 035 $a(EXLCZ)993400000000110397 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aIntroduction to Coding Theory$b[electronic resource] /$fby J.H. van Lint 205 $a2nd ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (XII, 186 p. 11 illus.) 225 1 $aGraduate Texts in Mathematics,$x0072-5285 ;$v86 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-54894-7 311 $a3-662-00176-4 320 $aIncludes bibliographical references and index. 327 $a1 Mathematical Background -- 1.1. Algebra -- 1.2. Krawtchouk Polynomials -- 1.3. Combinatorial Theory -- 1.4. Probability Theory -- 2 Shannon?s Theorem -- 2.1. Introduction -- 2.2. Shannon?s Theorem -- 2.3. Comments -- 2.4. Problems -- 3 Linear Codes -- 3.1. Block Codes -- 3.2. Linear Codes -- 3.3. Hamming Codes -- 3.4. Majority Logic Decoding -- 3.5. Weight Enumerators -- 3.6. Comments -- 3.7. Problems -- 4 Some Good Codes -- 4.1. Hadamard Codes and Generalizations -- 4.2. The Binary Golay Code -- 4.3. The Ternary Golay Code -- 4.4. Constructing Codes from Other Codes -- 4.5. Reed-Muller Codes -- 4.6. Kerdock Codes -- 4.7. Comments -- 4.8. Problems -- 5 Bounds on Codes -- 5.1. Introduction: The Gilbert Bound -- 5.2. Upper Bounds -- 5.3. The Linear Programming Bound -- 5.4. Comments -- 5.5. Problems -- 6 Cyclic Codes -- 6.1. Definitions -- 6.2. Generator Matrix and Check Polynomial -- 6.3. Zeros of a Cyclic Code -- 6.4. The Idempotent of a Cyclic Code -- 6.5. Other Representations of Cyclic Codes -- 6.6. BCH Codes -- 6.7. Decoding BCH Codes -- 6.8. Reed-Solomon Codes and Algebraic Geometry Codes -- 6.9. Quadratic Residue Codes -- 6.10. Binary Cyclic codes of length 2n (n odd) -- 6.11. Comments -- 6.12. Problems -- 7 Perfect Codes and Uniformly Packed Codes -- 7.1. Lloyd?s Theorem -- 7.2. The Characteristic Polynomial of a Code -- 7.3. Uniformly Packed Codes -- 7.4. Examples of Uniformly Packed Codes -- 7.5. Nonexistence Theorems -- 7.6. Comments -- 7.7. Problems -- 8 Goppa Codes -- 8.1. Motivation -- 8.2. Goppa Codes -- 8.3. The Minimum Distance of Goppa Codes -- 8.4. Asymptotic Behaviour of Goppa Codes -- 8.5. Decoding Goppa Codes -- 8.6. Generalized BCH Codes -- 8.7. Comments -- 8.8. Problems -- 9 Asymptotically Good Algebraic Codes -- 9.1. A Simple Nonconstructive Example -- 9.2. Justesen Codes -- 9.3. Comments -- 9.4. Problems -- 10 Arithmetic Codes -- 10.1. AN Codes -- 10.2. The Arithmetic and Modular Weight -- 10.3. Mandelbaum-Barrows Codes -- 10.4. Comments -- 10.5. Problems -- 11 Convolutional Codes -- 11.1. Introduction -- 11.2. Decoding of Convolutional Codes -- 11.3. An Analog of the Gilbert Bound for Some Convolutional Codes -- 11.4. Construction of Convolutional Codes from Cyclic Block Codes -- 11.5. Automorphisms of Convolutional Codes -- 11.6. Comments -- 11.7. Problems -- Hints and Solutions to Problems -- References. 330 $aThe first edition of this book was conceived in 1981 as an alternative to outdated, oversized, or overly specialized textbooks in this area of discrete mathematics-a field that is still growing in importance as the need for mathematicians and computer scientists in industry continues to grow. The body of the book consists of two parts: a rigorous, mathematically oriented first course in coding theory followed by introductions to special topics. The second edition has been largely expanded and revised. The main editions in the second edition are: (1) a long section on the binary Golay code; (2) a section on Kerdock codes; (3) a treatment of the Van Lint-Wilson bound for the minimum distance of cyclic codes; (4) a section on binary cyclic codes of even length; (5) an introduction to algebraic geometry codes. Eindhoven J. H. VAN LINT November 1991 Preface to the First Edition Coding theory is still a young subject. One can safely say that it was born in 1948. It is not surprising that it has not yet become a fixed topic in the curriculum of most universities. On the other hand, it is obvious that discrete mathematics is rapidly growing in importance. The growing need for mathe­ maticians and computer scientists in industry will lead to an increase in courses offered in the area of discrete mathematics. One of the most suitable and fascinating is, indeed, coding theory. 410 0$aGraduate Texts in Mathematics,$x0072-5285 ;$v86 606 $aNumber theory 606 $aCombinatorics 606 $aNumber Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M25001 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aNumber theory. 615 0$aCombinatorics. 615 14$aNumber Theory. 615 24$aCombinatorics. 676 $a512.7 686 $a94A24$2msc 700 $aLint$b J.H. van$4aut$4http://id.loc.gov/vocabulary/relators/aut$055409 906 $aBOOK 912 $a9910789216903321 996 $aIntroduction to coding theory$9374924 997 $aUNINA LEADER 03400nam 2200745Ia 450 001 9910974368903321 005 20200520144314.0 010 $a9786613093011 010 $a90-272-8635-3 010 $a1-283-09301-4 024 7 $a10.1075/veaw.g7 035 $a(CKB)2550000000033176 035 $a(EBL)680944 035 $a(OCoLC)714568541 035 $a(SSID)ssj0000467614 035 $a(PQKBManifestationID)11288731 035 $a(PQKBTitleCode)TC0000467614 035 $a(PQKBWorkID)10489810 035 $a(PQKB)11386991 035 $a(MiAaPQ)EBC680944 035 $a(Au-PeEL)EBL680944 035 $a(CaPaEBR)ebr10464444 035 $a(DE-B1597)719123 035 $a(DE-B1597)9789027286352 035 $a(EXLCZ)992550000000033176 100 $a19850904d1985 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aChicano English $ean ethnic contact dialect /$fby Joyce Penfield, Jacob L. Ornstein-Galicia 205 $a1st ed. 210 $aAmsterdam ;$aPhiladelphia $cJ. Benjamins Pub. Co.$d1985 215 $a1 online resource (112 pages) $cillustrations 225 1 $aVarieties of English around the world. General series,$x0017-7362 ;$vv. 7 300 $aDescription based upon print version of record. 311 0 $a90-272-4865-6 320 $aIncludes bibliographical references. 327 $aCHICANO ENGLISH: AN ETHNIC CONTACT DIALECT; Editorial page; Title page; Copyright page; Table of contents; PREFACE; I THE SOUTHWEST AS A LINGUISTIC AREA; II LOS CHICANOS; III SPEECH ASPECTS OF CHICANO ENGLISH; IV LITERACY DEVELOPMENT; V LANGUAGE ATTITUDES; VI REPRESENTATIONS OF CHICANO ENGLISH IN THE MEDIA; APPENDIX; REFERENCES; The series Varieties of English Around the World 330 $aChicano English can rightly be said to be, in its different varieties, the most widespread ethnic dialect of U.S. English, spoken by large sections of the population in the American Southwest. It represents a type of speech referred to by E. Haugen as a 'bilingual' dialect, having developed out of a stable Spanish-English setting. In their book, the authors provide a comprehensive examination of Chicano English, devoting particular emphasis to the social factors determining its characteristic features and uses. 410 0$aVarieties of English around the world.$pGeneral series ;$vv. 7. 606 $aEnglish language$xDialects$zSouthwestern States 606 $aMexican Americans$xLanguages 606 $aLanguages in contact$zSouthwestern States 606 $aBilingualism$zSouthwestern States 606 $aEnglish language$zUnited States$xForeign words and phrases$xSpanish 606 $aSpanish language$xInfluence on English 615 0$aEnglish language$xDialects 615 0$aMexican Americans$xLanguages. 615 0$aLanguages in contact 615 0$aBilingualism 615 0$aEnglish language$xForeign words and phrases$xSpanish. 615 0$aSpanish language$xInfluence on English. 676 $a427/.979 686 $aHF 999$qSEPA$2rvk 700 $aPenfield$b Joyce$0156632 701 $aOrnstein-Galicia$b Jacob$f1915-$0156633 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910974368903321 996 $aChicano English$9479245 997 $aUNINA