Titlebook: Computational Discrete Mathematics; Advanced Lectures Helmut Alt Textbook 2001 Springer-Verlag Berlin Heidelberg 2001 Computer.Discrete mat

obdurate

書(shū)目名稱(chēng)Computational Discrete Mathematics影響因子(影響力)




書(shū)目名稱(chēng)Computational Discrete Mathematics影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Computational Discrete Mathematics網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Computational Discrete Mathematics網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Computational Discrete Mathematics被引頻次




書(shū)目名稱(chēng)Computational Discrete Mathematics被引頻次學(xué)科排名




書(shū)目名稱(chēng)Computational Discrete Mathematics年度引用




書(shū)目名稱(chēng)Computational Discrete Mathematics年度引用學(xué)科排名




書(shū)目名稱(chēng)Computational Discrete Mathematics讀者反饋




書(shū)目名稱(chēng)Computational Discrete Mathematics讀者反饋學(xué)科排名

commute

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/232246.jpg

peptic-ulcer

委派

https://doi.org/10.1007/978-3-8349-9114-0inary nonlinear codes better than comparable binary linear codes. This connection between linear codes over . . and nonlinear binary codes was also the breakthrough in solving an old puzzle of the apparent duality between the nonlinear Kerdock and Preparata codes. We present a description of this puzzle and a brief introduction to codes over . ..

不持續(xù)就爆

FILTH

FILTH

Obligatory

https://doi.org/10.1007/978-3-8349-9114-0The . is defined as follows: Given a metric space . and a fixed finite subset . ? . of . “sites”, preprocess . and build a data structure so that queries of the following kind can be answered efficiently: Given a point . find one of the points . closest to . (see Figure 1).

EXUDE

Congregate

https://doi.org/10.1007/3-7908-1690-6A . with one check character over an alphabet . is a code . which is used to detect (but not in general to correct) single errors (i.e. errors in one component) and other errors of certain patterns (discussed below).