Tinea-Capitis 发表于 2025-3-25 04:42:45
Graduate Texts in Mathematicshttp://image.papertrans.cn/i/image/473524.jpgordain 发表于 2025-3-25 08:07:43
https://doi.org/10.1007/978-3-662-00174-5code; coding; coding theory; discrete mathematics; combinatorics沉默 发表于 2025-3-25 12:10:12
http://reply.papertrans.cn/48/4736/473524/473524_23.pngExonerate 发表于 2025-3-25 18:32:41
Textbook 19922nd editione 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. TAlcove 发表于 2025-3-25 21:50:17
0072-5285 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 specialProcesses 发表于 2025-3-26 02:01:28
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. ) 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. ).boisterous 发表于 2025-3-26 06:51:58
Bounds on Codes,.:= (. − 1)/.. Notation is as in Section 3.1. We assume . has been chosen and then define an (., *, .) code as a code with length . and minimum distance .. 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 ..Favorable 发表于 2025-3-26 11:50:16
http://reply.papertrans.cn/48/4736/473524/473524_28.pngPerigee 发表于 2025-3-26 15:07:24
http://reply.papertrans.cn/48/4736/473524/473524_29.pngfoppish 发表于 2025-3-26 18:51:42
http://reply.papertrans.cn/48/4736/473524/473524_30.png