Titlebook: Introduction to Coding Theory; J. H. Lint Textbook 19821st edition Springer Science+Business Media New York 1982 code.coding.coding theory

萬圣節(jié)

書目名稱Introduction to Coding Theory影響因子(影響力)




書目名稱Introduction to Coding Theory影響因子(影響力)學科排名




書目名稱Introduction to Coding Theory網絡公開度




書目名稱Introduction to Coding Theory網絡公開度學科排名




書目名稱Introduction to Coding Theory被引頻次




書目名稱Introduction to Coding Theory被引頻次學科排名




書目名稱Introduction to Coding Theory年度引用




書目名稱Introduction to Coding Theory年度引用學科排名




書目名稱Introduction to Coding Theory讀者反饋




書目名稱Introduction to Coding Theory讀者反饋學科排名

BUST

Perfect Codes and Uniformly Packed Codes,recting code. The theorem was first proved by S. P. Lloyd (1957) (indeed for . 2) using analytic methods. Since then it has been generalized by many authors (cf. [44]) but it is still referred to as Lloyd’s theorem. The proof in this section is due to D. M. Cvetkovi? and J. H. van Lint (1977; cf. [17]).

Parameter

BOLUS

0072-5285 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 o

溫和女人

Linear Codes,mbols .., .., ..,... is coded into an infinite sequence of message symbols. For example, for rate 1/2 one could have .., .., ..,... → .., .., .., ..,..., where ... is a function of ..,.., ...,... For block codes we generalize (2.1.3) to arbitrary alphabets.

TRAWL

Bounds on Codes,nce .. We are interested in the maximal number of codewords (i.e. the largest . which can be put in place of the *). An (., ., .) code which is not contained in any (., . + 1, .) code is called maximal.

Pelvic-Floor

夜晚

1分開

消散

Introduction to Coding Theory978-3-662-07998-0Series ISSN 0072-5285 Series E-ISSN 2197-5612