- 1、本文档共10页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
离散数学及其应用:群与编码课件
Groups and Coding Groups and Coding Coding of Binary Information and Error Detection Decoding and Error Correction Coding of Binary Information and Error Detection Encoding function Hamming distance Group Codes Parity check matrix Coding theory In today’s modern world of communication, data items are constantly being transmitted from point to point. The basic problem in transmission of data is that of receiving the data as sent and not receiving a distorted piece of data. Coding theory has developed techniques for introducing redundant information(引入冗余信息) in transmitted data that help in detecting, and sometimes in correcting, errors. Unit of information Message(消息) is a finite sequence of characters from a finite alphabet B = {0, l } Word(字) is a sequence of m 0s and l s. Groups The set B is a group under the binary operation + (mod 2 addition ) It follows that Bm = B ? B ? … ? B (n factors) is a group under the operator ? defined by (x1, x2,…, xm) ? (y1, y2 ,…, ym) = (x1 + y1, x2 + y2 , …, xm + ym) An element in Bm will be written as (b1,b2,..., bm) or more simply as b1b2...bm Transmission channel and Noise An element x ? Bm is sent through the transmission channel and is received as an element xt ? Bm. Transmission channel and Noise Noise(噪声) in the transmission channel may cause a 0 to be received as a l, or vice versa, lead x ? xt Encoding function - 编码函数 Choose: an integer nm and a one-to-one function e: Bm ? Bn e is called an (m, n) encoding function, representing every word in Bm as a word in Bn. If b ? Bm, then e(b) is called the code word(码字) representing b. Encoding function If the transmission channel is noiseless, then xt = x for all x in Bn. In this case x = e(b) is received for each b ? Bm, and since e is a known function, b may be identified. Encoding function In general, errors in transmission do occur. We will say that the code word x = e(b) has been transmitted with k or fewer errors if x and xt differ in at least 1 but no more than k positi
文档评论(0)