Relevant bibliographies by topics / Binary erasure channel

Contents

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

Academic literature on the topic 'Binary erasure channel'

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 'Binary erasure channel.'

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 "Binary erasure channel"

1

Andrievsky, Boris, Alexander L. Fradkov, and Elena V. Kudryashova. "Control of Two Satellites Relative Motion over the Packet Erasure Communication Channel with Limited Transmission Rate Based on Adaptive Coder." Electronics 9, no. 12 (December 1, 2020): 2032. http://dx.doi.org/10.3390/electronics9122032.

Full text
Abstract:
The paper deals with the navigation data exchange between two satellites moving in a swarm. It is focused on the reduction of the inter-satellite demanded communication channel capacity taking into account the dynamics of the satellites relative motion and possible erasures in the channel navigation data. The feedback control law is designed ensuring the regulation of the relative satellites motion. The adaptive binary coding/decoding procedure for the satellites navigation data transmission over the limited capacity communication channel is proposed and studied for the cases of ideal and erasure channels. Results of the numerical study of the closed-loop system performance and accuracy of the data transmission algorithm on the communication channel bitrate and erasure probability are obtained by extensive simulations. It is shown that both data transmission error and regulation time depend approximately inversely proportionally on the communication rate. In addition the erasure of data in the channel with probability up to 0.3 does not influence the regulation time for sufficiently high data transmission rate.
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Jeong W., RÜdiger L. Urbanke, and Richard E. Blahut. "Turbo Codes in Binary Erasure Channel." IEEE Transactions on Information Theory 54, no. 4 (April 2008): 1765–73. http://dx.doi.org/10.1109/tit.2008.917723.

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

Drăgoi, Vlad-Florin, and Gabriela Cristescu. "Bhattacharyya Parameter of Monomial Codes for the Binary Erasure Channel: From Pointwise to Average Reliability." Sensors 21, no. 9 (April 23, 2021): 2976. http://dx.doi.org/10.3390/s21092976.

Full text
Abstract:
Monomial codes were recently equipped with partial order relations, a fact that allowed researchers to discover structural properties and efficient algorithm for constructing polar codes. Here, we refine the existing order relations in the particular case of the binary erasure channel. The new order relation takes us closer to the ultimate order relation induced by the pointwise evaluation of the Bhattacharyya parameter of the synthetic channels, which is still a partial order relation. To overcome this issue, we appeal to a related technique from network theory. Reliability network theory was recently used in the context of polar coding and more generally in connection with decreasing monomial codes. In this article, we investigate how the concept of average reliability is applied for polar codes designed for the binary erasure channel. Instead of minimizing the error probability of the synthetic channels, for a particular value of the erasure parameter p, our codes minimize the average error probability of the synthetic channels. By means of basic network theory results, we determine a closed formula for the average reliability of a particular synthetic channel, that recently gain the attention of researchers.
APA, Harvard, Vancouver, ISO, and other styles
4

Kuribayashi, Minoru. "Bias-Based Binary Fingerprinting Code Under Erasure Channel." IEEE Signal Processing Letters 25, no. 9 (September 2018): 1423–27. http://dx.doi.org/10.1109/lsp.2018.2863034.

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

I Amat, Alexandre, and Eirik Rosnes. "Good concatenated code ensembles for the binary erasure channel." IEEE Journal on Selected Areas in Communications 27, no. 6 (August 2009): 928–43. http://dx.doi.org/10.1109/jsac.2009.090811.

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

Thomas, Eldho K., Vincent Y. F. Tan, Alexander Vardy, and Mehul Motani. "Polar Coding for the Binary Erasure Channel With Deletions." IEEE Communications Letters 21, no. 4 (April 2017): 710–13. http://dx.doi.org/10.1109/lcomm.2017.2650918.

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

Rashidpour, M., A. Shokrollahi, and S. H. Jamali. "Optimal regular LDPC codes for the binary erasure channel." IEEE Communications Letters 9, no. 6 (June 2005): 546–48. http://dx.doi.org/10.1109/lcomm.2005.1437366.

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

Changuel, S., R. Le Bidan, and R. Pyndiah. "Iterative decoding of product codes over binary erasure channel." Electronics Letters 46, no. 7 (2010): 503. http://dx.doi.org/10.1049/el.2010.0411.

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

Saberi, Amir, Farhad Farokhi, and Girish Nair. "Estimation and Control over a Nonstochastic Binary Erasure Channel." IFAC-PapersOnLine 51, no. 23 (2018): 265–70. http://dx.doi.org/10.1016/j.ifacol.2018.12.046.

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

Dall’Arno, Michele, Sarah Brandsen, and Francesco Buscemi. "Device-independent tests of quantum channels." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473, no. 2199 (March 2017): 20160721. http://dx.doi.org/10.1098/rspa.2016.0721.

Full text
Abstract:
We develop a device-independent framework for testing quantum channels. That is, we falsify a hypothesis about a quantum channel based only on an observed set of input–output correlations. Formally, the problem consists of characterizing the set of input–output correlations compatible with any arbitrary given quantum channel. For binary (i.e. two input symbols, two output symbols) correlations, we show that extremal correlations are always achieved by orthogonal encodings and measurements, irrespective of whether or not the channel preserves commutativity. We further provide a full, closed-form characterization of the sets of binary correlations in the case of: (i) any dihedrally covariant qubit channel (such as any Pauli and amplitude-damping channels) and (ii) any universally-covariant commutativity-preserving channel in an arbitrary dimension (such as any erasure, depolarizing, universal cloning and universal transposition channels).
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Binary erasure channel"

1

Stinner, Markus Christian [Verfasser]. "Analysis of Spatially Coupled LDPC Codes on the Binary Erasure Channel / Markus Christian Stinner." München : Verlag Dr. Hut, 2016. http://d-nb.info/1122524463/34.

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

Andersson, Mattias, Vishwambhar Rathi, Ragnar Thobaben, Joerg Kliewer, and Mikael Skoglund. "Equivocation of Eve using two edge type LDPC codes for the binary erasure wiretap channel." KTH, Kommunikationsteori, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-50634.

Full text
Abstract:
We consider transmission over a binary erasure wiretap channel using the code construction method introduced by Rathi et al. based on two edge type Low-Density Parity-Check (LDPC) codes and the coset encoding scheme. By generalizing the method of computing conditional entropy for standard LDPC ensembles introduced by Méasson, Montanari, and Urbanke to two edge type LDPC ensembles, we show how the equivocation for the wiretapper can be computed. We find that relatively simple constructions give very good secrecy performance and are close to the secrecy capacity.

Copyright 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. QC 20120110

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

Kozlík, Andrew. "Kódování a efektivita LDPC kódů." Master's thesis, 2011. http://www.nusl.cz/ntk/nusl-313897.

Full text
Abstract:
Low-density parity-check (LDPC) codes are linear error correcting codes which are capable of performing near channel capacity. Furthermore, they admit efficient decoding algorithms that provide near optimum performance. Their main disadvantage is that most LDPC codes have relatively complex encoders. In this thesis, we begin by giving a detailed discussion of the sum-product decoding algorithm, we then study the performance of LDPC codes on the binary erasure channel under sum-product decoding to obtain criteria for the design of codes that allow reliable transmission at rates arbitrarily close to channel capacity. Using these criteria we show how such codes are designed. We then present experimental results and compare them with theoretical predictions. Finally, we provide an overview of several approaches to solving the complex encoder problem.
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Cheng-hsun, and 李政勳. "Recovering Continuous Erasures in Binary Erasure Channels using by Low Density Parity Check Codes andnon-Recursive Convolutional Codes." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/78404887817807501542.

Full text
Abstract:
碩士
逢甲大學
產業研發碩士班
95
In the last few years due to wireless communication fast development,the people gradually already more and more not can lacking in wireless communication products.To be related product such as cell phone, PDA,wireless LAN and so on. Let the present generation people much convenient in the communication. Although wireless communication is convenient than wired communication, but the wireless communication to produce bit error rate in information transmission than the wired communication. So reduce the error rate of the communication in wireless communication, become a very important goal. There are many error correcting codes can reduce wireless communication error rate efficiently, non-Recursive convolutional codes and LDPC codes play an important role in recent years. Because they not only have higher coding performance, but also have simpler circuit and lower hardware cost. Non-recursive convolutional codes using shift-register and simple loop circuit to create higher encoding gain. LDPC(Low Density Parity Check) codes play better decoding function, its decoding gain approach Shannon’s limit. The goal of this research utilize non-Recursive convolutional codes as encoder and LDPC codes as decoder to optimize error correcting performance.
APA, Harvard, Vancouver, ISO, and other styles
5

zhong, wei-shuo, and 鐘偉碩. "Combining Low-Density Parity-Check Codes with Recursive Convolutional Codes for Error-Correction in Binary Erasure Channels." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/73912170852030929043.

Full text
Abstract:
碩士
逢甲大學
產業研發碩士班
95
With the progressing day by day of electronic science and technology, people''s life already can''t lack the relevant products of electron gradually. among them, the wireless communication has been paid more attention to day by day. The ones that must be overcome are that all information transmitted can be accepted infallibly in any several communication system, with the development of perfection of the theory of the code and digital circuit, many channel coding so as to succeed and widely application to the wireless communication system. There are many kinds of error correction mechanism nowadays. This thesis discusses mainly how to use low-density parity check codes(LDPC Code) ,With Recursive Convolutional Codes Design a simple and easy and effective error-correction the mechanism. Its will focus on combining two systematic linear block of compiled code technology, make recursive convolutional codes as encoder of this error correction mechanism, Convolutional Codes‘s generator matrix have low density and his regularity can be in accordance with following, through passing form of Linaer-Feedback Shift Registers(LFSR''s)can produced limited regular and being formulation Generator Sequences. Make low density-check code as decoder of this error correction mechanism, it is dealt with Erasure and that made an error when transmitting Separately by Bit-Flipping Decoding Algorithm and The Sum-Product Algorithm of low-density parity check code algorithm. Make use of error correct mechanism is it can improve efficiency of encoding , decoding, is it reduce transmission channels probability that make errors, can also increase the speed transmitted in channels. Keywords：error correction, low-density parity-check codes, convolutional codes, Linaer-Feedback Shift Registers, Erasure
APA, Harvard, Vancouver, ISO, and other styles
6

Dang, Rajdeep Singh. "Experimental Studies On A New Class Of Combinatorial LDPC Codes." Thesis, 2007. http://hdl.handle.net/2005/523.

Full text
Abstract:
We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth graph construction technique, and study the performance of the codes so constructed on both the Additive White Gaussian Noise (AWGN) channel as well as the Binary Erasure Channel (BEC). Our codes are “near regular”, meaning thereby that the the left degree of any node in the Tanner graph constructed varies by at most 1 from the average left degree and so also the right degree. The simulations for rate half codes indicate that the codes perform better than both the regular Progressive Edge Growth (PEG) codes which are constructed using a similar random technique, as well as the MacKay random codes. For high rates the ARG (Almost Regular high Girth) codes perform better than the PEG codes at low to medium SNR’s but the PEG codes seem to do better at high SNR’s. We have tried to track both near codewords as well as small weight codewords for these codes to examine the performance at high rates. For the binary erasure channel the performance of the ARG codes is better than that of the PEG codes. We have also proposed a modification of the sum-product decoding algorithm, where a quantity called the “node credibility” is used to appropriately process messages to check nodes. This technique substantially reduces the error rates at signal to noise ratios of 2.5dB and beyond for the codes experimented on. The average number of iterations to achieve this improved performance is practically the same as that for the traditional sum-product algorithm.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Binary erasure channel"

1

Gazi, Orhan. "Polarization of Binary Erasure Channels." In Polar Codes, 75–90. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-0737-9_3.

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

Lan, Lan, Lingqi Zeng, Ying Y. Tai, Lei Chen, Shu Lin, and Khaled Abdel-Ghaffar. "Algebraic Constructions of Quasi-cyclic LDPC Codes – Part I: For AWGN and Binary Random Erasure Channels." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 255–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11617983_25.

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

Tai, Ying Y., Lingqi Zeng, Lan Lan, Shumei Song, Shu Lin, and Khaled Abdel-Ghaffar. "Algebraic Construction of Quasi-cyclic LDPC Codes – Part II: For AWGN and Binary Random and Burst Erasure Channels." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 265–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11617983_26.

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

Lan, Lan, Ying Yu Tai, Shu Lin, Behshad Memari, and Bahram Honary. "New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 275–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11617983_27.

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

Conference papers on the topic "Binary erasure channel"

1

Sakai, Yuta, and Ken-ichi Iwata. "A generalized erasure channel in the sense of polarization for binary erasure channels." In 2016 IEEE Information Theory Workshop (ITW). IEEE, 2016. http://dx.doi.org/10.1109/itw.2016.7606864.

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

Yardi, Arti D. "Blind Reconstruction of Binary Cyclic Codes over Binary Erasure Channel." In 2018 International Symposium on Information Theory and Its Applications (ISITA). IEEE, 2018. http://dx.doi.org/10.23919/isita.2018.8664357.

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

Ivashkina, Marina, Iryna Andriyanova, Pablo Piantanida, and Charly Poulliat. "Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6284702.

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

Tavakoli, H., M. Ahmadian Attari, and M. Reza Peyghami. "Optimal rate and maximum erasure probability LDPC codes in binary erasure channel." In 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2011. http://dx.doi.org/10.1109/allerton.2011.6163054.

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

Nair, Chandra, and Yan Nan Wang. "Reverse hypercontractivity region for the binary erasure channel." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006666.

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

Savin, Valentin. "Non binary LDPC codes over the binary erasure channel: Density evolution analysis." In 2008 First International Symposium on Applied Sciences on Biomedical and Communication Technologies (ISABEL). IEEE, 2008. http://dx.doi.org/10.1109/isabel.2008.4712621.

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

Kellett, Christopher, and Steven Weller. "Bifurcations and EXIT charts for the Binary Erasure Channel." In 2006 IEEE International Symposium on Information Theory. IEEE, 2006. http://dx.doi.org/10.1109/isit.2006.262094.

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

Grinchenko, N., A. Gromov, and G. Ovechkin. "Improving performance of multithreshold decoder over binary erasure channel." In 2017 6th Mediterranean Conference on Embedded Computing (MECO). IEEE, 2017. http://dx.doi.org/10.1109/meco.2017.7977234.

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

Kraidy, Ghassan M., and Valentin Savin. "Irregular turbo code design for the binary erasure channel." In 2008 5th International Symposium on Turbo Codes and Related Topics. IEEE, 2008. http://dx.doi.org/10.1109/turbocoding.2008.4658711.

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

Guan, Rong, and Lijun Zhang. "Hybrid hamming GLDPC codes over the binary erasure channel." In 2017 11th IEEE International Conference on Anti-counterfeiting, Security, and Identification (ASID). IEEE, 2017. http://dx.doi.org/10.1109/icasid.2017.8285758.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Binary erasure channel' for particular source types:
Journal articles
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