Relevant bibliographies by topics / Binary symmetric channel

Contents

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

Academic literature on the topic 'Binary symmetric channel'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 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 symmetric 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 symmetric channel"

1

Podgorski, K., G. Simons, and Yi-Wen Ma. "On estimation for a binary-symmetric channel." IEEE Transactions on Information Theory 44, no. 3 (1998): 1260–72. http://dx.doi.org/10.1109/18.669319.

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

Han, Guangyue, and Brian Marcus. "Asymptotics of input-constrained binary symmetric channel capacity." Annals of Applied Probability 19, no. 3 (2009): 1063–91. http://dx.doi.org/10.1214/08-aap570.

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

Simons, G. "Estimating distortion in a binary symmetric channel consistently." IEEE Transactions on Information Theory 37, no. 5 (1991): 1466–70. http://dx.doi.org/10.1109/18.133270.

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

., S. Sugumaran. "PERFORMANCE ANALYSIS OF OCDMA IN BINARY SYMMETRIC CHANNEL." International Journal of Research in Engineering and Technology 05, no. 04 (2016): 387–90. http://dx.doi.org/10.15623/ijret.2016.0504072.

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

Harrison, Willie K., Telmo Fernandes, Marco A. C. Gomes, and Joao P. Vilela. "Generating a Binary Symmetric Channel for Wiretap Codes." IEEE Transactions on Information Forensics and Security 14, no. 8 (2019): 2128–38. http://dx.doi.org/10.1109/tifs.2019.2892010.

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

Chen, Yanling, and A. J. Han Vinck. "Secrecy coding for the binary symmetric wiretap channel." Security and Communication Networks 4, no. 8 (2010): 966–78. http://dx.doi.org/10.1002/sec.230.

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

Maltiyar, Kaveri, and Deepti Malviya. "Polar Code: An Advanced Encoding And Decoding Architecture For Next Generation 5G Applications." International Journal on Recent and Innovation Trends in Computing and Communication 7, no. 5 (2019): 26–29. http://dx.doi.org/10.17762/ijritcc.v7i5.5307.

Full text
Abstract:
Polar Codes become a new channel coding, which will be common to apply for next-generation wireless communication systems. Polar codes, introduced by Arikan, achieves the capacity of symmetric channels with “low encoding and decoding complexity” for a large class of underlying channels. Recently, polar code has become the most favorable error correcting code in the viewpoint of information theory due to its property of channel achieving capacity. Polar code achieves the capacity of the class of symmetric binary memory less channels. In this paper review of polar code, an advanced encoding and decoding architecture for next generation applications.
APA, Harvard, Vancouver, ISO, and other styles
8

Shirazinia, Amirpasha, Mikael Skoglund, Ali A. Zaidi, and Lei Bao. "Dynamic source–channel coding for estimation and control over binary symmetric channels." IET Control Theory & Applications 9, no. 9 (2015): 1444–54. http://dx.doi.org/10.1049/iet-cta.2014.1130.

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

Burnashev, M. V. "Code spectrum and the reliability function: Binary symmetric channel." Problems of Information Transmission 42, no. 4 (2006): 263–81. http://dx.doi.org/10.1134/s0032946006040016.

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

Fossorier, M. P. C., and S. Lin. "First-order approximation of the ordered binary-symmetric channel." IEEE Transactions on Information Theory 42, no. 5 (1996): 1381–87. http://dx.doi.org/10.1109/18.532880.

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

Dissertations / Theses on the topic "Binary symmetric channel"

1

Thangaraj, Andrew. "Iterative coding methods for the binary symmetric channel and magnetic recording channel." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/13387.

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

Patra, Soumyadip. "Distributed Emitter Detector Design under Imperfect Communication Channel." ScholarWorks@UNO, 2017. http://scholarworks.uno.edu/td/2391.

Full text
Abstract:
We consider the distributed detection of an emitter using multiple sensors deployed at deterministic locations. The signal from the emitter follows a signal attenuation model dependent on the distance between the sensor and the emitter. The sensors transmit their decisions to the fusion center through a parallel access Binary Symmetric Channel (BSC) with a cross-over probability. We seek to optimize the detection performance under a prescribed false alarm at the sensor level and at the system level. We consider the triangular topology structure and using the least favorable emitter range study the impact of the BSC on the system level detection fusion rules. The MAJORITY fusion rule is found to be optimal under certain conditions.
APA, Harvard, Vancouver, ISO, and other styles
3

Schofield, Mark. "The equivocation of codes." Thesis, University of Plymouth, 2018. http://hdl.handle.net/10026.1/11297.

Full text
Abstract:
Equivocation was introduced by Shannon in the late 1940’s in seminal papers that kick-started the whole field of information theory. Much ground has been covered on equivocation’s counterpart, channel capacity and in particular, its bounds. However, less work has been carried out on the evaluation of the equivocation of a code transmitted across a channel. The aim of the work covered in this thesis was to use a probabilistic approach to investigate and compare the equivocation of various codes across a range of channels. The probability and entropy of each output, given each input, can be used to calculate the equivocation. This gives a measure of the ambiguity and secrecy of a code when transmitted across a channel. The calculations increase exponentially in magnitude as both the message length and code length increase. In addition, the impact of factors such as erasures and deletions also serve to significantly complicate the process. In order to improve the calculation times offered by a conventional, linearly-programmed approach, an alternative strategy involving parallel processing with a CUDA-enabled (Compute Unified Device Architecture) graphical processor was employed. This enabled results to be obtained for codes of greater length than was possible with linear programming. However, the practical implementation of a CUDA driven, parallel processed solution gave rise to significant issues with both the software implementation and subsequent platform stability. By normalising equivocation results, it was possible to compare different codes under different conditions, making it possible to identify and select codes that gave a marked difference in the equivocation encountered by a legitimate receiver and an eavesdropper. The introduction of code expansion provided a novel method for enhancing equivocation differences still further. The work on parallel processing to calculate equivocation and the use of code expansion was published in the following conference: Schofield, M., Ahmed, M. & Tomlinson, M. (2015), Using parallel processing to calculate and improve equivocation, in ’IEEE Conference Publications - IEEE 16th International Conference on Communication Technology’. In addition to the novel use of a CUDA-enabled graphics process to calculated equivocation, equivocation calculations were also performed for expanded versions of the codes. Code expansion was shown to yield a dramatic increase in the achievable equivocation levels. Once methods had been developed with the Binary Symmetric Channel (BSC), they were extended to include work with intentional erasures on the BSC, intentional deletions on the BSC and work on the Binary Erasure Channel (BEC). The work on equivocation on the BSC with intentional erasures was published in: Schofield, M. et al, (2016), Intentional erasures and equivocation on the binary symmetric channel, in ’IEEE Conference Publications - International Computer Symposium’, IEEE, pp 233-235. The work on the BEC produced a novel outcome due to the erasure correction process employed. As the probability of an erasure occurring increases, the set of likely decoded outcomes diminishes. This directly impacts the output entropy of the system by decreasing it, thereby also affecting the equivocation value of the system. This aspect was something that had not been encountered previously. The work also extended to the consideration of intentional deletions on the BSC and the Binary Deletion Channel (BDC) itself. Although the methods used struggled to cope with the additional complexity brought by deletions, the use of Varshamov-Tenengolts codes on the BSC with intentional deletions showed that family of codes to be well suited to the channel arrangement as well as having the capability to be extended to enable the correction of multiple deletions.
APA, Harvard, Vancouver, ISO, and other styles
4

Isawhe, Boladale Modupe. "Sequential frame synchronization over binary symmetrical channel for unequally distributed data symbols." Thesis, Kingston University, 2017. http://eprints.kingston.ac.uk/39287/.

Full text
Abstract:
Frame synchronization is a critical task in digital communications receivers as it enables the accurate decoding and recovery of transmitted information. Information transmitted over a wireless channel is represented as bit stream. The bit stream is typically organized into groups of bits which can be of the same or variable length, known as frames, with frames being demarcated prior to transmission by a known bit sequence. The task of the frame synchronizer in the receiver is then to correctly determine frame boundaries, given that the received bit stream is a possibly corrupted version of the transmitted bit stream due to the error-prone nature of the wireless channel. Bearing in mind that the problem of frame synchronization has been studied extensively for wireless communications, where frames have a known, constant length, this thesis examines and seeks to make a contribution to the problem of frame synchronization where frames are of variable, unknown lengths. This is a common occurrence in the transmission of multimedia information and in packet or burst mode communications. Furthermore, a uniform distribution of data symbols is commonly assumed in frame synchronization works as this simplifies analysis. In many practical situations however, this assumption may not hold true. An example is in bit streams generated in video sequences encoded through discrete cosine transform (DCT) and also in more recent video coding standards (H.264). In this work, we therefore propose a novel, optimal frame synchronization metric for transmission over a binary symmetric channel (BSC) with a known, unequal source data symbol distribution, and where frames are of unknown, varying lengths. We thus extend prior studies carried out for the additive White Gaussian noise (AWGN) channel. We also provide a performance evaluation for the derived metric, using simulations and by exact mathematical analysis. In addition, we provide an exact analysis for the performance evaluation of the commonly used hard correlation (HC) metric, in the case where data symbols have a known, unequal distribution, which hitherto has not been made available in literature. We thus compare the performance of our proposed metric with that of the HC metric. Finally, the results of our study are applied to the investigation of cross-layer frame synchronization in the transmission of H.264 video over a Worldwide Interoperability for Microwave Access (WiMAX) system. We thus demonstrate priori knowledge of the source data distribution can be exploited to enhance frame synchronization performance, for the cases where hard decision decoding is desirable.
APA, Harvard, Vancouver, ISO, and other styles
5

Halbach, Till. "Error-robust coding and transformation of compressed hybered hybrid video streams for packet-switched wireless networks." Doctoral thesis, Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-136.

Full text
Abstract:
<p>This dissertation considers packet-switched wireless networks for transmission of variable-rate layered hybrid video streams. Target applications are video streaming and broadcasting services. The work can be divided into two main parts.</p><p>In the first part, a novel quality-scalable scheme based on coefficient refinement and encoder quality constraints is developed as a possible extension to the video coding standard H.264. After a technical introduction to the coding tools of H.264 with the main focus on error resilience features, various quality scalability schemes in previous research are reviewed. Based on this discussion, an encoder decoder framework is designed for an arbitrary number of quality layers, hereby also enabling region-of-interest coding. After that, the performance of the new system is exhaustively tested, showing that the bit rate increase typically encountered with scalable hybrid coding schemes is, for certain coding parameters, only small to moderate. The double- and triple-layer constellations of the framework are shown to perform superior to other systems.</p><p>The second part considers layered code streams as generated by the scheme of the first part. Various error propagation issues in hybrid streams are discussed, which leads to the definition of a decoder quality constraint and a segmentation of the code stream to transmit. A packetization scheme based on successive source rate consumption is drafted, followed by the formulation of the channel code rate optimization problem for an optimum assignment of available codes to the channel packets. Proper MSE-based error metrics are derived, incorporating the properties of the source signal, a terminate-on-error decoding strategy, error concealment, inter-packet dependencies, and the channel conditions. The Viterbi algorithm is presented as a low-complexity solution to the optimization problem, showing a great adaptivity of the joint source channel coding scheme to the channel conditions. An almost constant image qualiity is achieved, also in mismatch situations, while the overall channel code rate decreases only as little as necessary as the channel quality deteriorates. It is further shown that the variance of code distributions is only small, and that the codes are assigned irregularly to all channel packets.</p><p>A double-layer constellation of the framework clearly outperforms other schemes with a substantial margin. </p><p>Keywords — Digital lossy video compression, visual communication, variable bit rate (VBR), SNR scalability, layered image processing, quality layer, hybrid code stream, predictive coding, progressive bit stream, joint source channel coding, fidelity constraint, channel error robustness, resilience, concealment, packet-switched, mobile and wireless ATM, noisy transmission, packet loss, binary symmetric channel, streaming, broadcasting, satellite and radio links, H.264, MPEG-4 AVC, Viterbi, trellis, unequal error protection</p>
APA, Harvard, Vancouver, ISO, and other styles
6

Sung, Min-Tsang, and 宋敏菖. "Robust VQ-Based Digital Watermarking for the Memoryless Binary Symmetric Channel." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/28576552341867070317.

Full text
Abstract:
碩士<br>國立高雄應用科技大學<br>電子與資訊工程研究所碩士班<br>92<br>Vector quantization (VQ) has been distinguished for its high compression rate in lossy data compression applications. And VQ-based watermarking plays a newly developed branch in digital watermarking research fields. In this paper, we propose optimized schemes for VQ-based image watermarking. We overcome the VQ index assignment problem with genetic algorithm (GA), which is suitable for transmitting the watermarked image over noisy channels. We obtain better robustness of the watermarking algorithm against the effects caused by channel noise in our simulations after inspecting the results from several test images. In addition, to compare with existing schemes in literature, the watermarked image quality in our scheme has approximately the same quality, with better performance in robustness, to the schemes proposed by other researchers. This also proves the effectiveness of our proposed schemes in VQ-based image watermarking for copyright protection.
APA, Harvard, Vancouver, ISO, and other styles
7

Chang, Jung Hsin, and 張榮心. "Iterative Decoding Algorithms of Product Codes over a Binary Symmetric Channel." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/79362484725872681096.

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

Perry, Patrick. "The expected value for the probability of an undetected error using a linear code over an unknown binary symmetric channel." Thesis, 2007. http://hdl.handle.net/10125/20564.

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

Book chapters on the topic "Binary symmetric channel"

1

Weik, Martin H. "binary symmetric channel." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1558.

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

Weik, Martin H. "symmetric binary channel." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_18766.

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

Chen, Xiaomin, Vijay G. Subramanian, and Douglas J. Leith. "Binary Symmetric Channel Based Aggregation with Coding for 802.11n WLANs." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30376-0_17.

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

Fu, Fang-Wei, Torleiv Kløve, and Shu-Tao Xia. "On the Undetected Error Probability of m-out-of-n Codes on the Binary Symmetric Channel." In Coding Theory, Cryptography and Related Areas. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-642-57189-3_8.

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

Walrand, Jean. "Digital Link—A." In Probability in Electrical Engineering and Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-49995-2_7.

Full text
Abstract:
AbstractIn a digital link, a transmitter converts bits into signals and a receiver converts the signals it receives into bits. The receiver faces a decision problem that we study in Sect. 7.1. The main tool is Bayes’ Rule. The key notions are maximum a posteriori and maximum likelihood estimates. Transmission systems use codes to reduce the number of bits they need to transmit. Section 7.2 explains the Huffman codes that minimize the expected number of bits needed to transmit symbols; the idea is to use fewer bits for more likely symbols. Section 7.3 explores a commonly used model of a communication channel: the binary symmetric channel. It explains how to calculate the probability of errors. Section 7.4 studies a more complex modulation scheme employed by most smartphones and computers: QAM. Section 7.5 is devoted to a central problem in decision making: how to infer which situation is in force from observations. Does a test reveal the presence of a disease; how to balance the probability of false positive and that of false negative? The main result of that section is the Neyman–Pearson Theorem that the section illustrates with many examples.
APA, Harvard, Vancouver, ISO, and other styles
6

Mokhtari, Mohand, and Michel Marie. "Equalisation of a symmetrical binary channel." In Engineering Applications of MATLAB® 5.3 and SIMULINK® 3. Springer London, 2000. http://dx.doi.org/10.1007/978-1-4471-0741-5_14.

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

"Error detecting codes for the binary symmetric channel." In Codes for Error Detection. WORLD SCIENTIFIC, 2007. http://dx.doi.org/10.1142/9789812770516_0003.

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

Goeree, Jacob K., Charles A. Holt, and Thomas R. Palfrey. "Applications to Game Theory." In Quantal Response Equilibrium. Princeton University Press, 2016. http://dx.doi.org/10.23943/princeton/9780691124230.003.0007.

Full text
Abstract:
This chapter explores several applications of quantal response equilibrium (QRE) to specific games in order to illustrate and expand on the wide range of game-theoretic principles and phenomena associated with QRE that have been highlighted in the previous chapters. The first application considered belongs to the class of continuous games. With a continuum of decisions, QRE predicts a choice distribution that is not merely a (possibly asymmetric) spread to each side of a Nash equilibrium, since “feedback effects” from deviations by one player alter others' expected payoff profiles, which would induce further changes. The second application is a symmetric game with binary actions where players have continuously distributed private information about an unknown state of the world that affects both players' payoffs. The remainder of the chapter looks at three applications to extensive-form games, all of which are games of incomplete information.
APA, Harvard, Vancouver, ISO, and other styles
9

"much more needs to be done before we may begin and are summed up in Book VI, with its climactic to grasp the ‘goodly golden chayne, wherewith yfere vision of the Graces’. Clearly the poem was meant to | The vertues linked are in louely wize’ (I ix 1.1–2). be read as a verse in the Bible was read in Spenser’s For example, in displaying the special powers of a day: any stanza is the centre from which to recon-virtue, each book displays also its radical limitations struct the whole. without the other virtues, and, above all, without A study of the virtues makes it increasingly clear divine grace. No book is complete in itself, for each that before ever Spenser began to write he had seen (after the first) critiques those that preceded it, so at least the outline of each virtue and had mapped that understanding what has been read constantly out their relationships. (On the formal idea of each expands and consolidates until by the end all the virtue, which his narrative unfolds and realizes, see virtues are seen in their unifying relationships. Heninger 1991:147.) Early in his career, he dedicated A general survey of all the books of The Faerie his talents to fashion the scheme of virtues in a poem Queene is offered in a number of introductions to the he could never expect to complete, no more than poem: Spens 1934, Nelson 1963, R. Freeman 1970, could Chaucer in projecting the Canterbury Tales – Heale 1987, Tonkin 1989, Meyer 1991, Waller 1994, on its unfinished state, see Rajan 1985:44–84, and and Oram 1997. Tonkin and Oram especially offer Hamilton 1990 – and he never faltered or changed. close and perceptive readings of each book. In addi-What he says about the Red Cross Knight may be tion, there are studies of individual books. Book applied to him: ‘The noble hart, that harbours ver-I: Rose 1975; II: Berger 1957; III and IV: Roche tuous thought [i.e. knowledge of the virtues], | And 1964, Silberman 1995; IV: Goldberg 1981; III, IV, is with childe of glorious great intent, | Can neuer and V: Broaddus 1995; V: Dunseath 1968, Aptekar rest, vntill it forth haue brought | Th’eternall brood 1969, Fletcher 1971; VI: A. Williams 1967, Tonkin of glorie excellent’ (I v1.1–4). As he testifies in the 1972. See also the entry on each book in The Spenser final canto of the 1596 poem: as a ship may be Encyclopedia. In addition, there are general studies delayed by storms on its way to a certain shore, of the virtues: for example, Horton 1978 finds the ‘Right so it fares with me in this long way, | Whose poem’s unity in the binary pairing of the books (see course is often stayd, yet neuer is astray’ (VI xii also his entry, ‘virtues’, in the SEnc), and M.F.N. 1.8–9). While we may speculate that Spenser wrote Dixon 1996:13 argues that Spenser offers ‘a gram-for patronage, a pension, or a position at court, we mar of virtues’, i.e. ‘an iterative series of interde-know from the opening stanza of The Faerie Queene pendent virtues’. There are also many studies of the that ‘the sacred Muse’ commanded him ‘To blazon techniques used by Spenser to structure the virtues: broade emongst her learned throng’. Clearly he had for example, the ‘resonances sounding at large no choice but to devote his life to writing that poem. throughout the poem’ examined by Lewis 1967, the The third step in relating the virtues is to recog-structural triads by A. Fowler 1973, the poem’s nize that they are fashioned in the poem through the analogical coherence by Nohrnberg 1976, its self-actions of the major characters in order to fashion reflexiveness by MacCaffrey 1976, the ‘echoing’ by readers in ‘vertuous and gentle discipline’. In the Hollander 1981, the demonic parody of the virtues Letter to Raleigh, Spenser distinguishes between his by N. Frye 1963 and Fletcher 1971, the poem’s am-‘general intention and meaning’, which is to fashion bivalence by Fletcher 1964, the structural patterns in the virtues, and his poem’s ‘generall end’, which is Books I and II by Røstvig 1994, the symmetrical to ‘fashion a gentleman or noble person in vertuous ring structure in Book III by Greenfield 1989, the and gentle discipline’ (8). Accordingly, our under-poem’s broken symmetries by Kane 1990, the use of standing of the nature of holiness, for example, is gained image-patterns in which images are repeated in bono only by reading the story of the Red Cross Knight, et in malo by Kaske 1999, the sequence of emblems and not by bringing to it anything more than a which make the poem ‘the most emblematic long general awareness that the virtue relates our life in poem in our literature’ (A. Fowler 1999:23), and this world to God. His quest traces the process of the narrative’s self-reflectiveness by Goldberg 1981. sanctification as his will cooperates with divine grace; The poem interprets and reinterprets itself endlessly, and, through him, we learn how to frame our lives in as Tonkin 1989:43 suggests in commenting on holy living. The virtues do not exist apart from the." In Spenser: The Faerie Queene. Routledge, 2014. http://dx.doi.org/10.4324/9781315834696-26.

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

Conference papers on the topic "Binary symmetric channel"

1

Truong, Lan V., and Wojciech Szpankowski. "Capacity of a Structural Binary Symmetric Channel." In 2013 IEEE International Symposium on Information Theory (ISIT). IEEE, 2013. http://dx.doi.org/10.1109/isit.2013.6620672.

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

Chen-Yun, Zhang, and Zhang Hong. "Character of Channel Polarization in Symmetric Binary-Input Discrete Memoryless Channel." In 2016 International Symposium on Computer, Consumer and Control (IS3C). IEEE, 2016. http://dx.doi.org/10.1109/is3c.2016.165.

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

Houshou Chen. "Optimal generator matrices of binary cyclic codes over the binary symmetric channel." In 2007 Asia Pacific Conference on Communications. IEEE, 2007. http://dx.doi.org/10.1109/apcc.2007.4433455.

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

Vaidyanathaswami, Rajaraman, and Andrew Thangaraj. "Known plaintext attack on the binary symmetric wiretap channel." In 2011 IEEE Globecom Workshops. IEEE, 2011. http://dx.doi.org/10.1109/glocomw.2011.6162588.

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

Kameni Ngassa, Christiane L., Valentin Savin, and David Declercq. "Faulty stochastic LDPC decoders over the binary symmetric channel." In 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC). IEEE, 2014. http://dx.doi.org/10.1109/istc.2014.6955096.

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

Schofield, Mark, Mohammed Zaki Ahmed, Ingo Stengel, and Martin Tomlinson. "Intentional Erasures and Equivocation on the Binary Symmetric Channel." In 2016 International Computer Symposium (ICS). IEEE, 2016. http://dx.doi.org/10.1109/ics.2016.0053.

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

Hagiwara, Manabu, Marc P. C. Fossorier, and Hideki Imai. "LDPC codes with fixed initialization decoding over binary symmetric channel." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513630.

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

Planjery, Shiva Kumar, David Declercq, Shashi Kiran Chilappagari, and Bane Vasic. "Multilevel decoders surpassing belief propagation on the binary symmetric channel." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513620.

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

Chilappagari, Shashi, Sundararajan Sankaranarayanan, and Bane Vasic. "Error Floors of LDPC Codes on the Binary Symmetric Channel." In 2006 IEEE International Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/icc.2006.254892.

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

Kakhaki, A. Makhdoumi, H. Karkeh Abadi, P. Pad, H. Saeedi, F. Marvasti, and K. Alishahi. "Capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric Channel." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6284267.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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