Relevant bibliographies by topics / Error-correcting codes (Information theory) Radio

Contents

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

Academic literature on the topic 'Error-correcting codes (Information theory) Radio'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 February 2022

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-correcting codes (Information theory) Radio.'

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-correcting codes (Information theory) Radio"

1

Conway, J., and N. Sloane. "Lexicographic codes: Error-correcting codes from game theory." IEEE Transactions on Information Theory 32, no. 3 (May 1986): 337–48. http://dx.doi.org/10.1109/tit.1986.1057187.

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

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
3

Huang, Pengfei, Yi Liu, Xiaojie Zhang, Paul H. Siegel, and Erich F. Haratsch. "Syndrome-Coupled Rate-Compatible Error-Correcting Codes: Theory and Application." IEEE Transactions on Information Theory 66, no. 4 (April 2020): 2311–30. http://dx.doi.org/10.1109/tit.2020.2966439.

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

Namba, Kazuteru, and Eiji Fujiwara. "Nonbinary single-symbol error correcting, adjacent two-symbol transposition error correcting codes over integer rings." Systems and Computers in Japan 38, no. 8 (2007): 54–60. http://dx.doi.org/10.1002/scj.10516.

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

Ben-Gal, Irad, and Lev B. Levitin. "An application of information theory and error-correcting codes to fractional factorial experiments." Journal of Statistical Planning and Inference 92, no. 1-2 (January 2001): 267–82. http://dx.doi.org/10.1016/s0378-3758(00)00165-8.

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

Namba, Kazuteru, and Eiji Fujiwara. "A class of systematicm-ary single-symbol error correcting codes." Systems and Computers in Japan 32, no. 6 (2001): 21–28. http://dx.doi.org/10.1002/scj.1030.

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

Shimada, Ryosaku, Ryutaro Murakami, Kazuharu Sono, and Yoshiteru Ohkura. "Arithmetic burst error correcting fire-type cyclic ST-AN codes." Systems and Computers in Japan 18, no. 7 (1987): 57–68. http://dx.doi.org/10.1002/scj.4690180706.

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

Haselgrove, H. L., and P. P. Rohde. "Trade-off between the tolerance of located and unlocated errors in nondegenrate quantum." Quantum Information and Computation 8, no. 5 (May 2008): 399–410. http://dx.doi.org/10.26421/qic8.5-3.

Full text
Abstract:
In a recent study [Rohde et al., quant-ph/0603130 (2006)] of several quantum error correcting protocols designed for tolerance against qubit loss, it was shown that these protocols have the undesirable effect of magnifying the effects of depolarization noise. This raises the question of which general properties of quantum error-correcting codes might explain such an apparent trade-off between tolerance to located and unlocated error types. We extend the counting argument behind the well-known quantum Hamming bound to derive a bound on the weights of combinations of located and unlocated errors which are correctable by nondegenerate quantum codes. Numerical results show that the bound gives an excellent prediction to which combinations of unlocated and located errors can be corrected {\em with high probability} by certain large degenerate codes. The numerical results are explained partly by showing that the generalized bound, like the original, is closely connected to the information-theoretic quantity the {\em quantum coherent information}. However, we also show that as a measure of the exact performance of quantum codes, our generalized Hamming bound is provably far from tight.
APA, Harvard, Vancouver, ISO, and other styles
9

He, Xianmang. "Constructing new q-ary quantum MDS codes with distances bigger than q/2 from generator matrices." Quantum Information and Computation 18, no. 3&4 (March 2018): 223–30. http://dx.doi.org/10.26421/qic18.3-4-3.

Full text
Abstract:
The construction of quantum error-correcting codes has been an active field of quantum information theory since the publication of \cite{Shor1995Scheme,Steane1998Enlargement,Laflamme1996Perfect}. It is becoming more and more difficult to construct some new quantum MDS codes with large minimum distance. In this paper, based on the approach developed in the paper \cite{NewHeMDS2016}, we construct several new classes of quantum MDS codes. The quantum MDS codes exhibited here have not been constructed before and the distance parameters are bigger than q/2.
APA, Harvard, Vancouver, ISO, and other styles
10

Kuznetsov, Alexandr, Oleg Oleshko, and Kateryna Kuznetsova. "ENERGY GAIN FROM ERROR-CORRECTING CODING IN CHANNELS WITH GROUPING ERRORS." Acta Polytechnica 60, no. 1 (March 2, 2020): 65–72. http://dx.doi.org/10.14311/ap.2020.60.0065.

Full text
Abstract:
Abstract. This article explores the a mathematical model of the a data transmission channel with errors grouping. We propose an estimating method for energy gain from coding and energy efficiency of binary codes in channels with grouped errors. The proposed method uses a simplified Bennet and Froelich’s model and allows leading the research of the energy gain from coding for a wide class of data channels without restricting the way of the length distributing the error bursts. The reliability of the obtained results is confirmed by the information of the known results in the theory of error-correcting coding in the simplified variant.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Error-correcting codes (Information theory) Radio"

1

Wilson, Robert P. "Coding performance on the AX. 25 radio packet /." Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-07292009-090546/.

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

So, Daniel Ka Chun. "MIMO wireless communications in frequency selective fading channels /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202003%20SO.

Full text
Abstract:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 136-144). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO, and other styles
3

Talasila, Mahendra. "Implementation of Turbo Codes on GNU Radio." Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc33206/.

Full text
Abstract:
This thesis investigates the design and implementation of turbo codes over the GNU radio. The turbo codes is a class of iterative channel codes which demonstrates strong capability for error correction. A software defined radio (SDR) is a communication system which can implement different modulation schemes and tune to any frequency band by means of software that can control the programmable hardware. SDR utilizes the general purpose computer to perform certain signal processing techniques. We implement a turbo coding system using the Universal Software Radio Peripheral (USRP), a widely used SDR platform from Ettus. Detail configuration and performance comparison are also provided in this research.
APA, Harvard, Vancouver, ISO, and other styles
4

Pham, Edward Carleton University Dissertation Engineering Electrical. "SER prediction for transmission of PSAM 16-QAM in frequency selective fading channels." Ottawa, 1992.

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

Dai, Gao Yang. "A novel soft forwarding technique for cooperative communication /." View abstract or full-text, 2010. http://library.ust.hk/cgi/db/thesis.pl?ECED%202010%20DAI.

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

Salmon, Brian P. "Optimizing LDPC codes for a mobile WiMAX system with a saturated transmission amplifier." Pretoria : [s.n.], 2008. http://upetd.up.ac.za/thesis/available/etd-01262009-160431/.

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

Lucas, D'Oliveira Rafael Gregorio 1988. "Raio de empacotamento de códigos poset." [s.n.], 2012. http://repositorio.unicamp.br/jspui/handle/REPOSIP/305914.

Full text
Abstract:
Orientador: Marcelo Firer
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica
Made available in DSpace on 2018-08-21T02:49:59Z (GMT). No. of bitstreams: 1 LucasD'Oliveira_RafaelGregorio_M.pdf: 16647897 bytes, checksum: a2258aca5a39f0a7d0bd2243b905a772 (MD5) Previous issue date: 2012
Resumo: Até o trabalho presente, só era conhecido o raio de empacotamento de um código poset nos casos do poset ser uma cadeia, hierárquico, a união disjunta de cadeias do mesmo tamanho, e para algumas famílias de códigos. Nosso objetivo é abordar o caso geral de um poset qualquer. Para isso, iremos dividir o problema em dois. A primeira parte consiste em encontrar o raio de empacotamento de um único vetor. Veremos que este problema é equivalente à uma generalização de um problema NP-difícil famoso conhecido como \o problema da partição". Veremos então os principais resultados conhecidos sobre este problema dando atenção especial aos algoritmos para resolvê-lo. A receita principal destes algoritmos é o método da diferenciação, e sendo assim, iremos estendê-la para o caso geral. A segunda parte consiste em encontrar o vetor que determina o raio de empacotamento do código. Para isso, mostraremos como é as vezes possível comparar o raio de empacotamento de dois vetores sem calculá-los explicitamente
Abstract: Until the present work, the packing radius of a poset code was only known in the cases where the poset was a chain, hierarchy, a union of disjoint chains of the same size, and for some families of codes. Our objective is to approach the general case of any poset. To do this, we will divide the problem into two parts. The first part consists in finding the packing radius of a single vector. We will show that this is equivalent to a generalization of a famous NP-hard problem known as \the partition problem". Then, we will review the main results known about this problem giving special attention to the algorithms to solve it. The main ingredient to these algorithms is what is known as the differentiating method, and therefore, we will extend it to the general case. The second part consists in finding the vector that determines the packing radius of the code. For this, we will show how it is sometimes possible to compare the packing radius of two vectors without calculating them explicitly
Mestrado
Matematica
Mestre em Matemática
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Xuesong. "Cartesian authentication codes from error correcting codes /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20WANGX.

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

Rudra, Atri. "List decoding and property testing of error correcting codes /." Thesis, Connect to this title online; UW restricted, 2007. http://hdl.handle.net/1773/6929.

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

Nenno, Robert B. "An introduction to the theory of nonlinear error-correcting codes /." Online version of thesis, 1987. http://hdl.handle.net/1850/10350.

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

Books on the topic "Error-correcting codes (Information theory) Radio"

1

1954-, Le Ngoc Tho, ed. Coded-modulation techniques for fading channels. Boston: Kluwer Academic Publishers, 1994.

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

Weldon, E. J. Jr, coaut, ed. Error-Correcting Codes. 2nd ed. Boston: Massachusetts Institute of Technology, 1988.

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

Vera, Pless, ed. Fundamentals of error-correcting codes. Cambridge: Cambridge University Press, 2010.

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

MacWilliams, Florence Jessie. The theory of error correcting codes. 8th ed. Amsterdam: North-Holland Pub. Co., 1993.

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

Poli, Alain. Error correcting codes: Theory and applications. Hemel Hempstead: Prentice Hall, 1992.

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

Error-correcting coding theory. New York: McGraw-Hill, 1989.

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

Error-correcting codes and finite fields. Oxford: Clarendon Press, 1992.

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

Purser, Michael. Introduction to error-correcting codes. Boston: Artech House, 1995.

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

Error-correcting codes: A mathematical introduction. London: Chapman & Hall, 1998.

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

Block error-correcting codes: A computational primer. Berlin: Springer, 2003.

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

Book chapters on the topic "Error-correcting codes (Information theory) Radio"

1

Guimarães, Dayan Adionel. "Notions of Information Theory and Error-Correcting Codes." In Digital Transmission, 689–840. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01359-1_8.

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

"ERROR CORRECTING CODES." In A Quantum Leap in Information Theory, 115–36. WORLD SCIENTIFIC, 2020. http://dx.doi.org/10.1142/9789811201554_0010.

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

"Error-Correcting Codes." In Fundamentals of Information Theory and Coding Design, 247–92. Chapman and Hall/CRC, 2003. http://dx.doi.org/10.4324/9780203998106-8.

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

Djordjevic, Ivan B. "Information Theory and Classical Error Correcting Codes." In Quantum Information Processing, Quantum Computing, and Quantum Error Correction, 193–250. Elsevier, 2021. http://dx.doi.org/10.1016/b978-0-12-821982-9.00009-5.

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

Staiger, Ludwig. "From Error-correcting Codes to Algorithmic Information Theory." In Randomness Through Computation, 293–96. WORLD SCIENTIFIC, 2011. http://dx.doi.org/10.1142/9789814327756_0023.

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

Kaye, Phillip, Raymond Laflamme, and Michele Mosca. "Quantum Error Correction." In An Introduction to Quantum Computing. Oxford University Press, 2006. http://dx.doi.org/10.1093/oso/9780198570004.003.0013.

Full text
Abstract:
A mathematical model of computation is an idealized abstraction. We design algorithms and perform analysis on the assumption that the mathematical operations we specify will be carried out exactly, and without error. Physical devices that implement an abstract model of computation are imperfect and of limited precision. For example, when a digital circuit is implemented on a physical circuit board, unwanted electrical noise in the environment may cause components to behave differently than expected, and may cause voltage levels (bit-values) to change. These sources of error must be controlled or compensated for, or else the resulting loss of efficiency may reduce the power of the information-processing device. If individual steps in a computation succeed with probability p, then a computation involving t sequential steps will have a success probability that decreases exponentially as pt. Although it may be impossible to eliminate the sources of errors, we can devise schemes to allow us to recover from errors using a reasonable amount of additional resources. Many classical digital computing devices use error-correcting codes to perform detection of and recovery from errors. The theory of error-correcting codes is itself a mathematical abstraction, but it is one that explicitly accounts for errors introduced by the imperfection and imprecision of realistic devices. This theory has proven extremely effective in allowing engineers to build computing devices that are resilient against errors. Quantum computers are more susceptible to errors than classical digital computers, because quantum mechanical systems are more delicate and more difficult to control. If large-scale quantum computers are to be possible, a theory of quantum error correction is needed. The discovery of quantum error correction has given researchers confidence that realistic large-scale quantum computing devices can be built despite the presence of errors. We begin by considering fundamental concepts for error correction in a classical setting. We will focus on three of these concepts: (a) the characterization of the error model, (b) the introduction of redundancy through encoding, and (c) an error recovery procedure. We will later see that these concepts generalize quite naturally for quantum error correction.
APA, Harvard, Vancouver, ISO, and other styles
7

Fortino, Giancarlo, Carlos Calafate, and Pietro Manzoni. "Robust Broadcasting of Media Content in Urban Environments." In Next Generation Content Delivery Infrastructures, 105–20. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-1794-0.ch005.

Full text
Abstract:
In this work, the authors apply raptor codes to obtain a reliable broadcast system of non-time critical contents, such as multimedia advertisement and entertainment files, in urban environments. Vehicles in urban environments are characterized by a variable speed and by the fact that the propagation of the radio signal is constrained by the configuration of the city structure. Through real experiments, the authors demonstrate that raptor codes are the best option among the available Forward Error Correction techniques to achieve their purpose. Moreover, the system proposed uses traffic control techniques for classification and filtering of information. These techniques allow assigning different priorities to contents in order to receive firstly the most important ones from broadcasting antennas. In particular, as vehicle speed and/or distance from the broadcasting antenna increase, performance results highlight that these techniques are the only choice for a reliable data content delivery.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Error-correcting codes (Information theory) Radio"

1

Roth, Ron M. "Analog Error-Correcting Codes." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849843.

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

Wang, Qiwen, Sidharth Jaggi, and Shuo-Yen Robert Li. "Binary error correcting network codes." In 2011 IEEE Information Theory Workshop (ITW). IEEE, 2011. http://dx.doi.org/10.1109/itw.2011.6089511.

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

Yaakobi, Eitan, Paul H. Siegel, Alexander Vardy, and Jack K. Wolf. "Multiple error-correcting WOM-codes." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513373.

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

Buzaglo, Sarit, Eitan Yaakobi, Tuvi Etzion, and Jehoshua Bruck. "Error-correcting codes for multipermutations." In 2013 IEEE International Symposium on Information Theory (ISIT). IEEE, 2013. http://dx.doi.org/10.1109/isit.2013.6620321.

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

Yaakobi, Eitan, and Tuvi Etzion. "High dimensional error-correcting codes." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513662.

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

Klove, Torleiv, Bella Bose, and Noha Elarief. "Systematic single limited magnitude asymmetric error correcting codes." In 2010 IEEE Information Theory Workshop on Information Theory (ITW). IEEE, 2010. http://dx.doi.org/10.1109/itwksps.2010.5503196.

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

Roy, Shounak, and Shayan Srinivasa Garani. "Two Dimensional Algebraic Error Correcting Codes." In 2018 Information Theory and Applications Workshop (ITA). IEEE, 2018. http://dx.doi.org/10.1109/ita.2018.8502956.

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

Huang, Qin, Shu Lin, and Khaled Abdel-Ghaffar. "Error-correcting codes for flash coding." In 2011 Information Theory and Applications Workshop (ITA). IEEE, 2011. http://dx.doi.org/10.1109/ita.2011.5743580.

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

Ngai, Chi Kin, and Shenghao Yang. "Deterministic Secure Error-Correcting (SEC) Network Codes." In 2007 IEEE Information Theory Workshop. IEEE, 2007. http://dx.doi.org/10.1109/itw.2007.4313056.

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

Duan, Runyao, Markus Grassl, Zhengfeng Ji, and Bei Zeng. "Multi-error-correcting amplitude damping codes." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513648.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Error-correcting codes (Information theory) Radio' 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