Relevant bibliographies by topics / Error correction coding

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Error correction coding'

Author: Grafiati
Published: 4 June 2021
Last updated: 26 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Error correction coding.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Error correction coding"

1

Yasunaga, Kenji. "Error Correction by Structural Simplicity: Correcting Samplable Additive Errors." Computer Journal 62, no. 9 (October 5, 2018): 1265–76. http://dx.doi.org/10.1093/comjnl/bxy100.

Full text
Abstract:
Abstract This paper explores the possibilities and limitations of error correction by the structural simplicity of error mechanisms. Specifically, we consider channel models, called samplable additive channels, in which (i) errors are efficiently sampled without the knowledge of the coding scheme or the transmitted codeword; (ii) the entropy of the error distribution is bounded; and (iii) the number of errors introduced by the channel is unbounded. For the channels, several negative and positive results are provided. Assuming the existence of one-way functions, there are samplable additive errors of entropy nε for ε∈(0,1) that are pseudorandom, and thus not correctable by efficient coding schemes. It is shown that there is an oracle algorithm that induces a samplable distribution over {0,1}n of entropy m=ω(logn) that is not pseudorandom, but is uncorrectable by efficient schemes of rate less than 1−m/n−o(1). The results indicate that restricting error mechanisms to be efficiently samplable and not pseudorandom is insufficient for error correction. As positive results, some conditions are provided under which efficient error correction is possible.
APA, Harvard, Vancouver, ISO, and other styles
2

Durcek, Viktor, Michal Kuba, and Milan Dado. "Channel Coding in Optical Communication Systems." Transport and Communications 4, no. 2 (2016): 1–5. http://dx.doi.org/10.26552/tac.c.2016.2.1.

Full text
Abstract:
In this paper, an overview of various types of error-correcting codes is present. Three generations of forward error correction methods used in optical communication systems are listed and described. Forward error correction schemes proposed for use in future high-speed optical networks can be found in the third generation of codes.
APA, Harvard, Vancouver, ISO, and other styles
3

Faure, E. V. "FACTORIAL CODING WITH ERROR CORRECTION." Radio Electronics, Computer Science, Control, no. 3 (November 30, 2017): 130–38. http://dx.doi.org/10.15588/1607-3274-2017-3-15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Saleem, Huda, Huda Albermany, and Husein Hadi. "Proposed Method to Generated Strong Keys by Fuzzy Extractor And Biometric." International Journal of Engineering & Technology 7, no. 3.27 (August 15, 2018): 129. http://dx.doi.org/10.14419/ijet.v7i3.27.17672.

Full text
Abstract:
The typical scheme used to generated cryptographic key is a fuzzy extractor. The fuzzy extractor is the extraction of a stable data from biometric data or noisy data based on the error correction code (ECC) method. Forward error correction includes two ways are blocked and convolutional coding used for error control coding. “Bose_Chaudhuri_Hocquenghem” (BCH) is one of the error correcting codes employ to correct errors in noise data. In this paper use fuzzy extractor scheme to find strong key based on BCH coding, face recognition data used SVD method and hash function. Hash_512 converted a string with variable length into a string of fixed length, it aims to protect information against the threat of repudiation.
APA, Harvard, Vancouver, ISO, and other styles
5

Aseeri, Fatimah Mohammed M. "Written Corrective Feedback as Practiced by Instructors of Writing in English at Najran University." Journal of Education and Learning 8, no. 3 (May 10, 2019): 112. http://dx.doi.org/10.5539/jel.v8n3p112.

Full text
Abstract:
The present study aimed to address the extent to which faulty members and students at the department of English language at Najran University practice using the ways of written corrective feedback. The questionnaire, as the main study instrument was used to collect data while the descriptive analytical approach was used to analyze these collected data. Findings revealed that the direct way of correction, i.e., the identification of student’s errors by underlining or circling and then telling them how to correct such errors without allowing them the chance to figure out what the corrections are, was the most practiced way of written corrective feedback. Using Arabic, as it was students’ mother tongue, to show them their errors and then explain to them how to correct these errors was the second practiced way. Indirect correction like for example correcting student’s errors through writing in the margin that there was an error without giving them the correct answer was the least used way, as indicated by faculty members. Nevertheless, correcting students’ errors by coding the exact error in the text without giving them the correct answer was the least used way from students’ viewpoint. Moreover, findings showed that both faculty members and students were in favor of the comprehensive not the selective way of correction.
APA, Harvard, Vancouver, ISO, and other styles
6

Semerenko, Vasyl, and Oleksandr Voinalovich. "The simplification of computationals in error correction coding." Technology audit and production reserves 3, no. 2(59) (June 30, 2021): 24–28. http://dx.doi.org/10.15587/2706-5448.2021.233656.

Full text
Abstract:
The object of research is the processes of error correction transformation of information in automated systems. The research is aimed at reducing the complexity of decoding cyclic codes by combining modern mathematical models and practical tools. The main prerequisite for the complication of computations in deterministic linear error-correcting codes is the use of the algebraic representation as the main mathematical apparatus for these types of codes. Despite the universalism of the algebraic approach, its main drawback is the impossibility of taking into account the characteristic features of all subclasses of linear codes. In particular, the cyclic property is not taken into account at all for cyclic codes. Taking this property into account, one can go to a fundamentally different mathematical representation of cyclic codes – the theory of linear automata in Galois fields (linear finite-state machine). For the automaton representation of cyclic codes, it is proved that the problem of syndromic decoding of these codes in the general case is an NP-complete problem. However, if to use the proposed hierarchical approach to problems of complexity, then on its basis it is possible to carry out a more accurate analysis of the growth of computational complexity. Correction of single errors during one time interval (one iteration) of decoding has a linear decoding complexity on the length of the codeword, and error correction during m iterations of permutations of codeword bits has a polynomial complexity. According to three subclasses of cyclic codes, depending on the complexity of their decoding: easy decoding (linear complexity), iteratively decoded (polynomial complexity), complicate decoding (exponential complexity). Practical ways to reduce the complexity of computations are considered: alternate use of probabilistic and deterministic linear codes, simplification of software and hardware implementation by increasing the decoding time, use of interleaving. A method of interleaving is proposed, which makes it possible to simultaneously generate the burst errors and replace them with single errors. The mathematical apparatus of linear automata allows solving together the indicated problems of error correction coding.
APA, Harvard, Vancouver, ISO, and other styles
7

Chouksey, Sagar, Mayur Ghadle, Abdul Rasheed, and Shaikh Khursheed Mohd Murtaza. "PERFORMANCE AND ANALYSIS OF REED-SOLOMAN CODES FOR EFFICIENT COMMUNICATION SYSTE." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 10, no. 1 (July 25, 2013): 1249–54. http://dx.doi.org/10.24297/ijct.v10i1.3327.

Full text
Abstract:
In wireless communication systems reducing bit/frame/symbol error rate is critical. If bit error rates are high then in wireless communication system our aim is to minimize error by employing various coding methods on the data transferred. Various channel coding for error detection and correction helps the communication system designers to reduce the effects of a noisy data transmission channel. In this paper our focus is to study and analysis of the performance of Reed-Solomon code that is used to encode the data stream in digital communication. The performances were evaluated by applying to different phase sift keying (PSK) modulation scheme in Noisy channel. Reed-Solomon codes are one of the best for correcting burst errors and find wide range of applications in digital communications and data storage. Reed-Solomon codes are good coding technique for error correcting, in which redundant information is added to data so that it can be recovered reliably despite errors in transmission or retrieval. The error correction system used is based on a Reed-Solomon code. These codes are also used on satellite and other communications systems.Â
APA, Harvard, Vancouver, ISO, and other styles
8

Curto, Carina, Vladimir Itskov, Katherine Morrison, Zachary Roth, and Judy L. Walker. "Combinatorial Neural Codes from a Mathematical Coding Theory Perspective." Neural Computation 25, no. 7 (July 2013): 1891–925. http://dx.doi.org/10.1162/neco_a_00459.

Full text
Abstract:
Shannon's seminal 1948 work gave rise to two distinct areas of research: information theory and mathematical coding theory. While information theory has had a strong influence on theoretical neuroscience, ideas from mathematical coding theory have received considerably less attention. Here we take a new look at combinatorial neural codes from a mathematical coding theory perspective, examining the error correction capabilities of familiar receptive field codes (RF codes). We find, perhaps surprisingly, that the high levels of redundancy present in these codes do not support accurate error correction, although the error-correcting performance of receptive field codes catches up to that of random comparison codes when a small tolerance to error is introduced. However, receptive field codes are good at reflecting distances between represented stimuli, while the random comparison codes are not. We suggest that a compromise in error-correcting capability may be a necessary price to pay for a neural code whose structure serves not only error correction, but must also reflect relationships between stimuli.
APA, Harvard, Vancouver, ISO, and other styles
9

Kalmykov, Igor Anatolyevich, Vladimir Petrovich Pashintsev, Kamil Talyatovich Tyncherov, Aleksandr Anatolyevich Olenev, and Nikita Konstantinovich Chistousov. "Error-Correction Coding Using Polynomial Residue Number System." Applied Sciences 12, no. 7 (March 25, 2022): 3365. http://dx.doi.org/10.3390/app12073365.

Full text
Abstract:
There has been a tendency to use the theory of finite Galois fields, or GF(2n), in cryptographic ciphers (AES, Kuznyechik) and digital signal processing (DSP) systems. It is advisable to use modular codes of the polynomial residue number system (PRNS). Modular codes of PRNS are arithmetic codes in which addition, subtraction and multiplication operations are performed in parallel on the bases of the code, which are irreducible polynomials. In this case, the operands are small-bit residues. However, the independence of calculations on the bases of the code and the lack of data exchange between the residues can serve as the basis for constructing codes of PRNS capable of detecting and correcting errors that occur during calculations. The article will consider the principles of constructing redundant codes of the polynomial residue number system. The results of the study of codes of PRNS with minimal redundancy are presented. It is shown that these codes are only able to detect an error in the code combination of PRNS. It is proposed to use two control bases, the use of which allows us to correct an error in any residue of the code combination, in order to increase the error-correction abilities of the code of the polynomial residue number system. Therefore, the development of an algorithm for detecting and correcting errors in the code of the polynomial residue number system, which allows for performing this procedure based on modular operations that are effectively implemented in codes of PRNS, is an urgent task.
APA, Harvard, Vancouver, ISO, and other styles
10

SHOOMAN, MARTIN L., and FRANK A. CASSARA. "RELIABILITY OF ERROR CORRECTING CODES ON WIRELESS INFORMATION NETWORKS." International Journal of Reliability, Quality and Safety Engineering 03, no. 04 (December 1996): 283–304. http://dx.doi.org/10.1142/s0218539396000193.

Full text
Abstract:
Error correcting codes are well known techniques for improving bit error rate (BER) performance in digital communication systems and are particularly important in wireless information networks to help establish reliable communication links. This paper examines the effect of coder/decoder circuitry failures on the overall communication system performance. A system analysis of the error correction coding scheme performance must include an evaluation of the reliability of the coder/decoder circuitry because their failures also serve as a source of undetected errors. The parity bit code, Hamming single error correcting and detecting code, and the Reed–Solomon code are included in the study. Results reveal that for applications as described in the text that require low bit error rate and operate at low data rates, the reliability of the coding circuitry can play a significant role in determining overall system performance. In fact, for such error and data rates, a simpler coding scheme with higher circuit reliability may actually be more beneficial than a more complex coding scheme with enhanced error correcting ability but with a higher chip failure rate.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Error correction coding"

1

Zhang, Wenbo. "Unary error correction coding." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/419401/.

Full text
Abstract:
In this thesis, we introduce the novel concept of Unary Error Correction (UEC) coding. Our UEC code is a Joint Source and Channel Coding (JSCC) scheme conceived for performing both the compression and error correction of multimedia information during its transmission from an encoder to a decoder. The UEC encoder generates a bit sequence by concatenating and encoding unary codewords, while the decoder operates on the basis of a trellis that has only a modest complexity, even when the source symbol values are selected from a set having an infinite cardinality, such as the set of all positive integers. This trellis is designed so that the transitions between its states are synchronous with the transitions between the consecutive unary codewords in the concatenated bit sequence. This allows the UEC decoder to exploit any residual redundancy that remains following UEC encoding for the purpose of error correction by using the classic Bahl, Cocke, Jelinek and Raviv (BCJR) algorithm. Owing to this, the UEC code is capable of mitigating any potential capacity loss, hence facilitating near-capacity operation, even when the cardinality of the symbol value set is infinite. We investigate the applications, characteristics and performance of the UEC code in the context of digital telecommunications. Firstly, we propose an adaptive UEC design for expediting the decoding process. By concatenating the UEC code with a turbo code, we conceive a three-stage concatenated adaptive iterative decoding technique. A Three-Dimensional (3D) EXtrinsic Information Transfer (EXIT) chart technique is proposed for both controlling the dynamic adaptation of the UEC trellis decoder, as well as for controlling the activation order between the UEC decoder and the turbo decoder. Secondly, we develop an irregular UEC design for ‘nearer-capacity’ operation. The irregular scheme employs different UEC parametrizations for the coding of different subsets of each message frame, operating on the basis of a single irregular trellis having a novel structure. This allows the irregularity to be controlled on a fine-grained bit-by-bit basis, rather than on a symbol-by-symbol basis. Hence, nearer-to-capacity operation is facilitated by exploiting this fine-grained control of the irregularity. Thirdly, we propose a learning-aided UEC design for transmitting symbol values selected from unknown and non-stationary probability distributions. The learning-aided UEC scheme is capable of heuristically inferring the source symbol distribution, hence eliminating the requirement of any prior knowledge of the symbol occurrence probabilities at either the transmitter or the receiver. This is achieved by inferring the source distribution based on the received symbols and by feeding this information back to the decoder. In this way, the quality of the recovered symbols and the estimate of the source distribution can be gradually improved in successive frames, hence allowing reliable near-capacity operation to be achieved, even if the source is unknown and non-stationary. Finally, we demonstrate that the research illustrated in this thesis can be extended in several directions, by highlighting a number of opportunities for future work. The techniques proposed for enhancing the UEC code can be extended to the Rice Error Correction (RiceEC) code, to the Elias Gamma Error Correction (EGEC) code and to the Exponential Golomb Error Correction (ExpGEC) code. In this way, our UEC scheme may be extended to the family of universal error correction codes, which facilitate the nearcapacity transmission of infinite-cardinality symbol alphabets having any arbitrary monotonic probability distribution, as well as providing a wider range of applications. With these benefits, this thesis may contribute to future standards for the reliable near-capacity transmission of multimedia information, having significant technical and economic impact.
APA, Harvard, Vancouver, ISO, and other styles
2

Lundqvist, Henrik. "Error Correction Coding for Optical CDMA." Licentiate thesis, KTH, Microelectronics and Information Technology, IMIT, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-1637.

Full text
Abstract:

The optical fiber is a very attractive communication mediumsince it offers a large bandwidth and low attenuation and cantherefore facilitate demanding services such as high-qualityvideo transmission. As the reach of optical fiber is beingextended to the access network it is economically attractive toshare fibers between different users without adding activecomponents in the network. The most common multiple accessmethod for such passive optical networks is time divisionmultiple access (TDMA), but lately there has been an increasedinterest in using wavelength division multiple access (WDMA)and optical code division multiple access (OCDMA). This thesisevaluates forward error correction as a method to improve theperformance of passive optical networks, in particular OCDMAnetworks.

Most studies of OCDMA use simple channel models focusingonly on the multiple access interference. However, beat noiseis the main performance limitation for many implementations ofOCDMA. Beat noise occurs when multiple optical fields areincident on a receiver, because of the square-law detection. Tomake a realistic evaluation of OCDMA, channel models which takeinterference, beat noise and other noise types into account arestudied in this thesis. Both direct sequencing CDMA and fastfrequency hopping are considered as spreading methods. Anefficient simulation method was developed in order to simulatesystems with forward error correction (FEC) and soft decoding.The simulations show that the performance is significantlyoverestimated when the beat noise is neglected. In order todecrease the error rate without using overly complex equipmentthe bandwidth has to be increased. Simulation results show thatit is beneficial to use error correction codes in addition tospreading codes for the bandwidth expansion. The efficiency canbe further improved by using soft decoding; therefore maximumlikelihood decoding methods for the OCDMA channels aredeveloped and demonstrate a significant reduction in the errorrate. Frequency hopping and direct sequencing are also comparedwith each other, and the results show that temporally codedOCDMA is more sensitive to beat noise.

In addition, the performance of a low complexity softdecoding method for Reed-Solomon codes is evaluated. Softdecoding of Reed Solomon codes has not yet found practical usebecause the earlier proposed methods do not offer sufficientperformance gains to motivate the increased complexity. Thebit-level Chase-decoding algorithm evaluated here can be easilyimplemented using any algebraic decoder.

APA, Harvard, Vancouver, ISO, and other styles
3

Cheung, Kar-Ming McEliece Robert J. "Error-correction coding in data storage systems /." Diss., Pasadena, Calif. : California Institute of Technology, 1987. http://resolver.caltech.edu/CaltechETD:etd-02282008-133009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Klinc, Demijan. "On applications of puncturing in error-correction coding." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39610.

Full text
Abstract:
This thesis investigates applications of puncturing in error-correction coding and physical layer security with an emphasis on binary and non-binary LDPC codes. Theoretical framework for the analysis of punctured binary LDPC codes at short block lengths is developed and a novel decoding scheme is designed that achieves considerably faster convergence than conventional approaches. Subsequently, optimized puncturing and shortening is studied for non-binary LDPC codes over binary input channels. Framework for the analysis of punctured/shortened non-binary LDPC codes over the BEC channel is developed, which enables the optimization of puncturing and shortening patterns. Insight from this analysis is used to develop algorithms for puncturing and shortening of non-binary LDPC codes at finite block lengths that perform well. It is confirmed that symbol-wise puncturing is generally bad and that bit-wise punctured non-binary LDPC codes can significantly outperform their binary counterparts, thus making them an attractive solution for future communication systems; both for error-correction and distributed compression. Puncturing is also considered in the context of physical layer security. It is shown that puncturing can be used effectively for coding over the wiretap channel to hide the message bits from eavesdroppers. Further, it is shown how puncturing patterns can be optimized for enhanced secrecy. Asymptotic analysis confirms that eavesdroppers are forced to operate at BERs very close to 0.5, even if their signal is only slightly worse than that of the legitimate receivers. The proposed coding scheme is naturally applicable at finite block lengths and allows for efficient, almost-linear time encoding. Finally, it is shown how error-correcting codes can be used to solve an open problem of compressing data encrypted with block ciphers such as AES. Coding schemes for multiple chaining modes are proposed and it is verified that considerable compression gains are attainable for binary sources.
APA, Harvard, Vancouver, ISO, and other styles
5

Kong, Der-Hung. "Simulation of coherent signals with forward error correction coding." Thesis, Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion.exe/07Mar%5FKong.pdf.

Full text
Abstract:
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, March 2007.
Thesis Advisor(s): Clark Robertson. "March 2007." Includes bibliographical references (p.47-48). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
6

Von, Solms Suné. "Exploiting the implicit error correcting ability of networks that use random network coding / by Suné von Solms." Thesis, North-West University, 2009. http://hdl.handle.net/10394/3991.

Full text
Abstract:
In this dissertation, we developed a method that uses the redundant information implicitly generated inside a random network coding network to apply error correction to the transmitted message. The obtained results show that the developed implicit error correcting method can reduce the effect of errors in a random network coding network without the addition of redundant information at the source node. This method presents numerous advantages compared to the documented concatenated error correction methods. We found that various error correction schemes can be implemented without adding redundancy at the source nodes. The decoding ability of this method is dependent on the network characteristics. We found that large networks with a high level of interconnectivity yield more redundant information allowing more advanced error correction schemes to be implemented. Network coding networks are prone to error propagation. We present the results of the effect of link error probability on our scheme and show that our scheme outperforms concatenated error correction schemes for low link error probability.
Thesis (M.Ing. (Computer Engineering))--North-West University, Potchefstroom Campus, 2010.
APA, Harvard, Vancouver, ISO, and other styles
7

Hashmi, Shafiq Ullah. "Efficient forward error correction coding technique for spread spectrum communications." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0021/MQ54317.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

He, Zhongmin. "A generic postprocessing technique for image coding applications." Thesis, University of Portsmouth, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.264852.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rice, Mark. "Decoding of cyclic block codes." Thesis, University of Manchester, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.330207.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shen, Bingxin. "Application of Error Correction Codes in Wireless Sensor Networks." Fogler Library, University of Maine, 2007. http://www.library.umaine.edu/theses/pdf/ShenB2007.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Error correction coding"

1

Moon, Todd K. Error Correction Coding. New York: John Wiley & Sons, Ltd., 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Guang, Xuan, and Zhen Zhang. Linear Network Error Correction Coding. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-0588-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tomlinson, Martin, Cen Jung Tjhai, Marcel A. Ambroze, Mohammed Ahmed, and Mubarak Jibril. Error-Correction Coding and Decoding. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51103-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gazi, Orhan. Forward Error Correction via Channel Coding. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-33380-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Geisel, William A. Tutorial on Reed-Solomon error correction coding. Houston, Texas: National Aeronautics and Space Administration, Lyndon B. Johnson Space Center, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Geisel, William A. Tutorial on Reed-Solomon error correction coding. Houston, Texas: National Aeronautics and Space Administration, Lyndon B. Johnson Space Center, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Geisel, William A. Tutorial on Reed-Solomon error correction coding. Houston, Texas: National Aeronautics and Space Administration, Lyndon B. Johnson Space Center, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Error coding cookbook: Practical C/C++ routines and recipes for error detection and correction. New York: McGraw-Hill, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tomlinson, Martin. Error-Correction Coding and Decoding: Bounds, Codes, Decoders, Analysis and Applications. Cham: Springer Nature, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

The mathematics of coding theory: Information, compression, error correction, and finite fields. Upper Saddle River, NJ: Pearson Prentice Hall, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Error correction coding"

1

Buchanan, William J. "Error Coding (Correction)." In Advanced Data Communications and Networks, 185–204. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4419-8670-2_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Buchanan, Bill. "Error Coding (Correction)." In Handbook of Data Communications and Networks, 154–69. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-0905-6_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tomlinson, Martin, Cen Jung Tjhai, Marcel A. Ambroze, Mohammed Ahmed, and Mubarak Jibril. "Combined Error Detection and Error-Correction." In Error-Correction Coding and Decoding, 435–50. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51103-0_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Houghton, A. "Error Correction by Parity." In Error Coding for Engineers, 41–47. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-1509-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Guang, Xuan, and Zhen Zhang. "Network Error Correction Model." In Linear Network Error Correction Coding, 17–31. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-0588-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Houghton, A. "Error Correction Using the CRC." In Error Coding for Engineers, 49–65. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-1509-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tomlinson, Martin, Cen Jung Tjhai, Marcel A. Ambroze, Mohammed Ahmed, and Mubarak Jibril. "Erasures and Error-Correcting Codes." In Error-Correction Coding and Decoding, 367–98. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51103-0_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tomlinson, Martin, Cen Jung Tjhai, Marcel A. Ambroze, Mohammed Ahmed, and Mubarak Jibril. "Bounds on Error-Correction Coding Performance." In Error-Correction Coding and Decoding, 3–23. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51103-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tomlinson, Martin, Cen Jung Tjhai, Marcel A. Ambroze, Mohammed Ahmed, and Mubarak Jibril. "Historical Convolutional Codes as Tail-Biting Block Codes." In Error-Correction Coding and Decoding, 289–98. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51103-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tomlinson, Martin, Cen Jung Tjhai, Marcel A. Ambroze, Mohammed Ahmed, and Mubarak Jibril. "Analogue BCH Codes and Direct Reduced Echelon Parity Check Matrix Construction." In Error-Correction Coding and Decoding, 299–314. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51103-0_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Error correction coding"

1

Dau, Son Hoang, Vitaly Skachek, and Yeow Meng Chee. "Index coding and error correction." In 2011 IEEE International Symposium on Information Theory - ISIT. IEEE, 2011. http://dx.doi.org/10.1109/isit.2011.6033856.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Guang, Xuan, Fang-Wei Fu, and Zhen Zhang. "Universal Network Error Correction MDS Codes." In 2011 International Symposium on Network Coding (NetCod). IEEE, 2011. http://dx.doi.org/10.1109/isnetcod.2011.5979063.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Becker-Lakus, Axel, Ka-Ming Leung, and Zhonghua Ma. "Bitwise prediction error correction for Distributed Video Coding." In 2010 Picture Coding Symposium (PCS). IEEE, 2010. http://dx.doi.org/10.1109/pcs.2010.5702514.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Leeson, Mark S., and Matthew D. Higgins. "Error correction coding for molecular communications." In ICC 2012 - 2012 IEEE International Conference on Communications. IEEE, 2012. http://dx.doi.org/10.1109/icc.2012.6364980.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Guang, Xuan, and Raymond W. Yeung. "Linear Network Error Correction Coding Revisited." In 2020 IEEE International Symposium on Information Theory (ISIT). IEEE, 2020. http://dx.doi.org/10.1109/isit44484.2020.9174493.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Zhen. "Network Error Correction Coding in Packetized Networks." In 2006 IEEE Information Theory Workshop. IEEE, 2006. http://dx.doi.org/10.1109/itw.2006.322854.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Zhen. "Network Error Correction Coding in Packetized Networks." In 2006 IEEE Information Theory Workshop - ITW '06 Chengdu. IEEE, 2006. http://dx.doi.org/10.1109/itw2.2006.323836.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Shenghao, and Raymond W. Yeung. "Refined Coding Bounds for Network Error Correction." In 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks. IEEE, 2007. http://dx.doi.org/10.1109/itwitwn.2007.4318046.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Roth, Ron M., and Pascal O. Vontobel. "Coding for combined block-symbol error correction." In 2013 IEEE International Symposium on Information Theory (ISIT). IEEE, 2013. http://dx.doi.org/10.1109/isit.2013.6620420.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kim, Kwang Taik, Chan-Soo Hwang, and Vahid Tarokh. "Network error correction from matrix network coding." In 2011 Information Theory and Applications Workshop (ITA). IEEE, 2011. http://dx.doi.org/10.1109/ita.2011.5743611.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Error correction coding"

1

Xu, Y., R. J. Mural, and E. C. Uberbacher. Correcting sequencing errors in DNA coding regions using a dynamic programming approach. Office of Scientific and Technical Information (OSTI), December 1994. http://dx.doi.org/10.2172/10105444.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Error correction coding' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography