找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Coding Theory; Jacobus H. Lint Book 1973Latest edition Springer-Verlag Berlin Heidelberg 1973 Finite.algebra.coding.coding theory.error-co

[復(fù)制鏈接]
樓主: 監(jiān)管
21#
發(fā)表于 2025-3-25 06:53:42 | 只看該作者
Introduction,ctice this is not the case. . is added to the information and as a result . are introduced by the channel. For example in telephone conversations there is cross-talk, thermal noise, impulsive switching noise, sometimes lightning causes noise; in radio we have static; magnetic tapes sometimes have the wrong digits after storage etc.
22#
發(fā)表于 2025-3-25 09:07:28 | 只看該作者
0075-8434 t the California Institute of Technology. The students who took the course were mathematics seniors and graduate students. Therefore a thorough knowledge of algebra. (a. o. linear algebra, theory of finite fields, characters of abelian groups) and also probability theory were assumed. After introduc
23#
發(fā)表于 2025-3-25 12:16:36 | 只看該作者
Nani G. Bhowmik,J. Rodger Adamsis the residue class ring R mod S, i.e. (GF(q)[x] mod ({x.-1},+, ). The elements of this ring can be represented by polynomials of degree < n with coefficients in GF(q). The additive group of R/S is isomorphic to .. An isomorphism is given by associating the vector . = (a.,a., ... ,a.) with the polynomial a. + a.x + ... + a.x..
24#
發(fā)表于 2025-3-25 16:38:25 | 只看該作者
25#
發(fā)表于 2025-3-25 21:59:04 | 只看該作者
Cyclic codes,is the residue class ring R mod S, i.e. (GF(q)[x] mod ({x.-1},+, ). The elements of this ring can be represented by polynomials of degree < n with coefficients in GF(q). The additive group of R/S is isomorphic to .. An isomorphism is given by associating the vector . = (a.,a., ... ,a.) with the polynomial a. + a.x + ... + a.x..
26#
發(fā)表于 2025-3-26 02:44:51 | 只看該作者
Perfect codes, the first nonzero entry in each column is 1. Since no linear combination of two columns can be . we see that H is the parity check matrix of a linear (n,k) code over GF(q) with minimum distance 3. Because q.{1 + n(q-1)} = q. = q. the code is perfect.
27#
發(fā)表于 2025-3-26 06:07:39 | 只看該作者
Book 1973Latest editionerm these two topics would have been chosen. Although the material for this course came from many sources there are three which contributed heavily and which were used as suggested reading material for the students. These are W. W. Peterson‘s Error-Correcting Codes ?(15]), E. R. Berlekamp‘s Algebrai
28#
發(fā)表于 2025-3-26 10:40:56 | 只看該作者
29#
發(fā)表于 2025-3-26 16:02:43 | 只看該作者
8樓
30#
發(fā)表于 2025-3-26 18:38:13 | 只看該作者
8樓
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 09:46
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
西林县| 肥城市| 文成县| 阿拉尔市| 天水市| 池州市| 九寨沟县| 汉中市| 横峰县| 元江| 阜南县| 南皮县| 乌审旗| 达孜县| 长春市| 樟树市| 万源市| 石首市| 郁南县| 灌云县| 隆尧县| 怀柔区| 西华县| 黑山县| 沈阳市| 静宁县| 高雄县| 龙泉市| 长丰县| 沾益县| 稷山县| 微山县| 万荣县| 苏尼特右旗| 平南县| 岗巴县| 高邑县| 晋城| 白河县| 湟源县| 梁山县|