標(biāo)題: Titlebook: Error Coding for Engineers; A. Houghton Book 2001 Springer Science+Business Media New York 2001 Boolean algebra.Hardware.algebra.coding.co [打印本頁(yè)] 作者: Interpolate 時(shí)間: 2025-3-21 18:13
書(shū)目名稱(chēng)Error Coding for Engineers影響因子(影響力)
書(shū)目名稱(chēng)Error Coding for Engineers影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Error Coding for Engineers網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Error Coding for Engineers網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Error Coding for Engineers被引頻次
書(shū)目名稱(chēng)Error Coding for Engineers被引頻次學(xué)科排名
書(shū)目名稱(chēng)Error Coding for Engineers年度引用
書(shū)目名稱(chēng)Error Coding for Engineers年度引用學(xué)科排名
書(shū)目名稱(chēng)Error Coding for Engineers讀者反饋
書(shū)目名稱(chēng)Error Coding for Engineers讀者反饋學(xué)科排名
作者: 鄙視讀作 時(shí)間: 2025-3-21 21:31 作者: Nmda-Receptor 時(shí)間: 2025-3-22 02:24 作者: BROW 時(shí)間: 2025-3-22 07:40 作者: discord 時(shí)間: 2025-3-22 09:03
978-1-4613-5589-2Springer Science+Business Media New York 2001作者: 懦夫 時(shí)間: 2025-3-22 13:21
Error Coding for Engineers978-1-4615-1509-8Series ISSN 0893-3405 作者: 懦夫 時(shí)間: 2025-3-22 19:10
The Springer International Series in Engineering and Computer Sciencehttp://image.papertrans.cn/e/image/314913.jpg作者: 吞下 時(shí)間: 2025-3-22 23:55
Stéphane Larochelle,Robert P. Fisher subject, but in pragmatic terms of what’s underneath it that makes it work. The maths which surrounds error coding serves two key purposes; one, it shows us what can theoretically be achieved by error coding and what we might reasonable have to do to get there and, two, it provides mechanisms for i作者: eustachian-tube 時(shí)間: 2025-3-23 04:17
Antonio Giordano,Gaetano Romanon theoretical, point of view, always with hardware implementation in mind. No attempt is made to prove the ideas considered here since there are plenty of excellent texts on the subject and (mathematicians: look away now) generally in engineering, “if it works twice, it‘s a law”. No one who has ever作者: Palatial 時(shí)間: 2025-3-23 09:09
Andrea Viale,Pier Giuseppe Peliccid messages. With error correction, however, more space is generally required as is some mechanism for finding the nearest valid message to a corrupted one. Error detection provides a gentle introduction into practical coding and two techniques are examined. Both techniques can be applied to error co作者: filial 時(shí)間: 2025-3-23 11:32 作者: Aids209 時(shí)間: 2025-3-23 17:43 作者: 多山 時(shí)間: 2025-3-23 18:02 作者: Mortal 時(shí)間: 2025-3-24 00:38 作者: Factorable 時(shí)間: 2025-3-24 03:44 作者: Pulmonary-Veins 時(shí)間: 2025-3-24 10:34 作者: acrophobia 時(shí)間: 2025-3-24 13:25 作者: Systemic 時(shí)間: 2025-3-24 17:24 作者: VOK 時(shí)間: 2025-3-24 20:08
https://doi.org/10.1007/978-1-4615-1509-8Boolean algebra; Hardware; algebra; coding; communication; design; detection; digital signal processor; inte作者: Semblance 時(shí)間: 2025-3-25 00:19 作者: 聯(lián)想 時(shí)間: 2025-3-25 04:58 作者: 意見(jiàn)一致 時(shí)間: 2025-3-25 08:33 作者: Aids209 時(shí)間: 2025-3-25 14:12 作者: legitimate 時(shí)間: 2025-3-25 15:50 作者: 法律的瑕疵 時(shí)間: 2025-3-25 21:59
Bit Error Rates,rience a raw BER of about 10.. This simply means that on average, one bit in 100 will be in error, or the probability that any bit will be incorrect is 0.01. Given a system requirement for a certain BER, we can see how much work the error coding needs to do.作者: 善變 時(shí)間: 2025-3-26 02:23 作者: oblique 時(shí)間: 2025-3-26 05:50 作者: Hyperalgesia 時(shí)間: 2025-3-26 10:42
Regulation of Cell Cycle and Apoptosis,he shortcomings of the simple horizontal parity check could be overcome. If, however, only a single-bit error occurs then the bit which is intersected by both horizontal and vertical parity errors will be the bit in error, and it can be corrected.作者: Truculent 時(shí)間: 2025-3-26 14:04
Model Organisms for Studying the Cell Cyclethe message, and that the CRC is based on a primitive generator polynomial. If the CRC is . bits, then the total protected message length (i.e. including the CRC itself) must be less than 2. bits. A CRC encoded message, .. to ..., (. = 2. ? 1) satisfies the equation ..作者: consent 時(shí)間: 2025-3-26 18:44 作者: gerrymander 時(shí)間: 2025-3-26 23:51
Error Correction by Parity,he shortcomings of the simple horizontal parity check could be overcome. If, however, only a single-bit error occurs then the bit which is intersected by both horizontal and vertical parity errors will be the bit in error, and it can be corrected.作者: 強(qiáng)壯 時(shí)間: 2025-3-27 02:23 作者: 機(jī)密 時(shí)間: 2025-3-27 08:20
Augmenting Error Codes,ound impact on the end performance that is achieved, often at relatively little cost. In this chapter some of these strategies will be examined, along with the kinds of environments where they are likely to be effective.作者: mercenary 時(shí)間: 2025-3-27 09:54 作者: habitat 時(shí)間: 2025-3-27 14:47
Antonio Giordano,Gaetano Romano used maths for anything practical can have failed to notice how amazing it is that diverse approaches to problems converge upon common answers. Logic, of course, predicts this and this is also why mathematicians go to great lengths to prove that “it wasn‘t a fluke and it‘ll work more than twice”.作者: EXPEL 時(shí)間: 2025-3-27 20:53 作者: 的染料 時(shí)間: 2025-3-27 22:10
https://doi.org/10.1007/978-3-540-37390-2 be generic, capable of supporting arbitrary field size or primitive polynomial, or it might be specific to a particular field. Any solution will be a function of available resources, speed of execution and the application.作者: 分開(kāi) 時(shí)間: 2025-3-28 03:12 作者: Assault 時(shí)間: 2025-3-28 07:50 作者: 干旱 時(shí)間: 2025-3-28 10:32
Reed-Muller Codes,ays, the opposite of Hamming codes. Taking a typical Hamming code, say (15, 11), with four redundancy bits, the corresponding maximal length code would be a (15, 4) code so now, . = 2. ? 1 and . is the number of information bits. This gives a very low coding rate of about 0.27.作者: 新鮮 時(shí)間: 2025-3-28 15:51
Hardware, be generic, capable of supporting arbitrary field size or primitive polynomial, or it might be specific to a particular field. Any solution will be a function of available resources, speed of execution and the application.作者: 吹牛需要藝術(shù) 時(shí)間: 2025-3-28 22:06
Introduction, subject, but in pragmatic terms of what’s underneath it that makes it work. The maths which surrounds error coding serves two key purposes; one, it shows us what can theoretically be achieved by error coding and what we might reasonable have to do to get there and, two, it provides mechanisms for i作者: Trochlea 時(shí)間: 2025-3-29 02:54 作者: 西瓜 時(shí)間: 2025-3-29 03:49
Error Detection,d messages. With error correction, however, more space is generally required as is some mechanism for finding the nearest valid message to a corrupted one. Error detection provides a gentle introduction into practical coding and two techniques are examined. Both techniques can be applied to error co作者: 假裝是你 時(shí)間: 2025-3-29 07:40
Error Correction by Parity,le of vertical parity checking in conjunction with horizontal parity checking. The purpose of that particular example was to illustrate that some of the shortcomings of the simple horizontal parity check could be overcome. If, however, only a single-bit error occurs then the bit which is intersected作者: 不透氣 時(shí)間: 2025-3-29 11:56
Error Correction Using the CRC,re economic solution. A single-bit error can be corrected provided the CRC is long enough to describe every bit location within the protected part of the message, and that the CRC is based on a primitive generator polynomial. If the CRC is . bits, then the total protected message length (i.e. includ作者: exophthalmos 時(shí)間: 2025-3-29 15:47 作者: Halfhearted 時(shí)間: 2025-3-29 20:44 作者: 指令 時(shí)間: 2025-3-30 03:05
Augmenting Error Codes,ironment if it is to be effective. Not only this but there are some relatively simple steps that can be included in the coding which have a truly profound impact on the end performance that is achieved, often at relatively little cost. In this chapter some of these strategies will be examined, along作者: ellagic-acid 時(shí)間: 2025-3-30 05:19
Convolutional Coding,ck codes the data are compiled into blocks prior to encoding and transmission and must be subsequently recompiled into blocks for decoding and error correction. The second strategy is called . or . coding. Here data may be error encoded on a continuous basis without the need for compilation into blo
