Filters








15 Hits in 4.2 sec

Adaptive Single-Trial Error/Erasure Decoding for Binary Codes [article]

Christian Senger, Vladimir R. Sidorenko, Steffen Schober, Martin Bossert, Victor V. Zyablov
2010 arXiv   pre-print
We investigate adaptive single-trial error/erasure decoding of binary codes whose decoder is able to correct e errors and t erasures if le+t<=d-1.  ...  The error/erasure decoder allows to exploit soft information by treating a set of most unreliable received symbols as erasures.  ...  In this paper, we provided two algorithms for adaptive single-trial error/erasure decoding for binary codes. The erasing strategy of the first algorithm is guaranteed to be optimal.  ... 
arXiv:1004.3372v2 fatcat:wmjoe2a7gzh5nkxrjxi5gi26ay

Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes [article]

Christian Senger, Vladimir R. Sidorenko, Steffen Schober, Martin Bossert, Victor V. Zyablov
2011 arXiv   pre-print
In this paper we investigate adaptive single-trial error/erasure decoding of Reed-Solomon codes, i.e. we derive an adaptive erasing strategy which minimizes the residual codeword error probability after  ...  Our result is applicable to any error/erasure decoding algorithm as long as its decoding capabilities can be expressed by a decoder capability function.  ...  In [12] , the complexity of adaptive single-trial error/erasure decoding of binary codes with the Hoeffding approximation of P (τ ) is stated to be in O(n 2 √ n), this also holds for our case of (non-binary  ... 
arXiv:1104.0576v1 fatcat:3rc36d3murdwrh5koahyttbg3a

Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff

J. H. Weber, V. R. Sidorenko, C. Senger, K. A. S. Abdel-Ghaffar
2012 Problems of Information Transmission  
We investigate singletrial strategies for GMD decoding with arbitrary error-erasure tradeoff, based on either erasing a fraction of the received symbols or erasing all symbols whose reliability values  ...  The fraction/threshold may be either static or adaptive, where adaptive means that the erasing is a function of the channel output.  ...  We use a BD (bounded distance) error-erasure decoder Φ BD for the code C, which is assumed to correct t errors and e erasures if and only if λt + e ≤ d − 1, (2) where λ is an error-erasure tradeoff from  ... 
doi:10.1134/s0032946012040023 fatcat:l6eero7zv5eybadken5bnmtcg4

Reduced GMD decoding

J.H. Weber, K.A.S. Abdel-Ghaffar
2003 IEEE Transactions on Information Theory  
In GMD decoding, symbols received from the channel may be erased before being fed into an algebraic error-erasure decoder for error correction, in subsequent or simultaneous trials with different erasing  ...  A framework is presented for generalized minimum distance (GMD) decoding with a limited number of decoding trials and a restricted set of reliability values.  ...  ACKNOWLEDGMENT The authors wish to thank the anonymous reviewers and the Associate Editor for their suggestions that improved the quality of this correspondence.  ... 
doi:10.1109/tit.2003.809504 fatcat:zvtcvcyrxvag7nsrc66kdh55qe

Adaptive frequency hopping in HF communications

J. Zander
1995 IEE Proceedings - Communications  
By means of powerful coding techniques, these systems are able to restore the transmitted information also under adverse transmission conditions when several of the frequencies in use are not available  ...  A straightforward adaptive frequency hopping (AFH) scheme for duplex links is proposed and analysed.  ...  In our case this is done by erasing the received bit and the using the combined error/erasure correcting properties of the code.  ... 
doi:10.1049/ip-com:19951650 fatcat:ukhslnpwufdbnplyspb46e5ae4

Channel Detection in Coded Communication [article]

Nir Weinberger, Neri Merhav
2015 arXiv   pre-print
Then, various achievable bounds on the error exponents are derived, including the exact single-letter characterization of the random coding exponents for the optimal detector/decoder.  ...  The case of a pair of binary symmetric channels is discussed in detail.  ...  For example, in Forney's error/erasure setting [17] , one of the events defined and analyzed is the total error event, which is comprised of a union of an undetected error event and an erasure event.  ... 
arXiv:1509.01806v1 fatcat:4v7oexw2kjcyzipoyhdup5mkwy

Channel Detection in Coded Communication

Nir Weinberger, Neri Merhav
2017 IEEE Transactions on Information Theory  
Then, various achievable bounds on the error exponents are derived, including the exact single-letter characterization of the random coding exponents for the optimal detector/decoder.  ...  The case of sets of binary symmetric channels is discussed in detail.  ...  For example, in Forney's error/erasure setting [17] , one of the events defined and analyzed is the total error event, which is comprised of a union of an undetected error event and an erasure event.  ... 
doi:10.1109/tit.2017.2732356 fatcat:75o57eogpzgn3ilnfpqk4mjw64

Rank-Metric Codes and Their Applications [article]

Hannes Bartz, Lukas Holzbaur, Hedongliang Liu, Sven Puchinger, Julian Renner, Antonia Wachter-Zeh
2022 arXiv   pre-print
In code-based cryptography, the hardness of the corresponding generic decoding problem can lead to systems with reduced public-key size.  ...  In distributed data storage, codes in the rank metric have been used repeatedly to construct codes with locality, and in coded caching, they have been employed for the placement of coded symbols.  ...  Acknowledgements The work of L. Holzbaur and A. Wachter  ... 
arXiv:2203.12384v1 fatcat:brysqya7ynem5i25adxfwf5vl4

A Side-Channel Attack on a Masked IND-CCA Secure Saber KEM Implementation

Kalle Ngo, Elena Dubrova, Qian Guo, Thomas Johansson
2021 Transactions on Cryptographic Hardware and Embedded Systems  
We also present a new secret key recovery approach based on maps from error-correcting codes that can compensate for some errors in the recovered message.  ...  In this paper, we present a side-channel attack on a first-order masked implementation of IND-CCA secure Saber KEM.  ...  Acknowledgments We are indebted to the authors of [BDK + 20] who generously shared with us their source code of the masked Saber.  ... 
doi:10.46586/tches.v2021.i4.676-707 fatcat:3pbsgu5gcrelrdrrd7zv3kg4wq

Secret key authentication capacity region, Part I: average authentication rate [article]

Jake Perazzone, Eric Graves, Paul Yu, Rick Blum
2020 arXiv   pre-print
In this first study the authenticated rate is measured by the traditional metric of the maximum expected probability of false authentication.  ...  their choosing (done in hopes of having the destination accept a false message).  ...  e lower bound on the total probability error (erasure and undetected) under no attack. Hence, these two summations can be analyzed individually without impact to the total performance.  ... 
arXiv:2001.01668v1 fatcat:oee3qdijbzhi3hwbza6t3wz6hu

On the construction, dimensionality, and decoding of linear block code trellises

Alan D. Kot
1992
In principle, the coding gain of a digital communications system can be improved through the use of longer error control codes and soft-decision maximum-likelihood (ML) decoding.  ...  In this thesis, we consider several aspects of trellis-based ML, and 'near-ML', soft-decision decoding of general linear block codes.  ...  The probability of error for the errors/erasures decoder is denoted as PEE.  ... 
doi:10.14288/1.0065096 fatcat:a2uia6mtkvg33bvdqidwefbpke

Signal and receiver design for high density digital magnetic tape recording

Roger William Wood
1979
The playback receiver comprised a fixed pre-filter followed by an adaptive seven-tap transversal, filter.  ...  In particular, erasure detection and interleaved block coding proved to be useful techniques. The application of decision feedback was found to provide only marginal improvements in performance.  ...  The elements of the -137 -outer code may be rendered independent by interleaving although Reed-Solomon codes [165, 243] exhibit useful burst error/erasure correction capability.  ... 
doi:10.14288/1.0065619 fatcat:3ibsv22nrzfkzesggu6eacnxki

Cooperating error-correcting codes and their decoding [article]

LMGM Ludo Tolhuizen, JH Van Lint, HCA Henk Van Tilborg
1996
Janssen for finding the asymptotical behaviour of Sn described in Subsection 7.4.3. Acknowledgments The authors thank their colleagues H.D.L. Hollmann, A.G.C.  ...  Random error and burst correction by iterated codes. IEEE Trans. Inform. Th., IT-18(1):182-185, January 1972. [16] S. Wainberg. Error-erasure decoding of product codes. IEEE Trans. Inform.  ...  A new efficient error-erasure location scheme in gmd decoding. In Proc. 1993 IEEE Int. Symp. Inform. Theory, page 33, San Antonio, TX, January 1993. [9] U.K. Sorger.  ... 
doi:10.6100/ir462079 fatcat:uol5b54ibneaxir2dwj3fwcri4

Digital watermarking and data hiding in multimedia

Abdulaziz, Nidhal Kadhim, 1958-
2017
182 decoded for consumption according to usage rights associated with the content (quoted from a web paper by Leonardo Chiariglione, Convener, MPEG; (http://www.telecomitalialab.com/threports_e.htm).  ...  References 183 References ACKNOWLEDGMENTS The author would like to thank University of Southern California, Signal and Image processing Institute (USC-SIPI) Image Database for using their classic  ...  Error correcting codes provide coders with a tool to recover lost information such as errors, erasures and deletions.  ... 
doi:10.4225/03/59d44ace2f9d5 fatcat:6ah66x7prbbhvp4mu2yplgtzey

Cryptography based on the Hardness of Decoding

Nico Marcel Döttling
2014
This thesis provides progress in the fields of for lattice and coding based cryptography.  ...  The first contribution consists of constructions of IND-CCA2 secure public key cryptosystems from both the McEliece and the low noise learning parity with noise assumption.  ...  In case the code-alphabet is binary, we refer to symbol errors as bit errors. Erasure Errors Erasure errors model the detectable loss of information in a transmitted message.  ... 
doi:10.5445/ir/1000041110 fatcat:ntqa7i3wwzh5djmxsxuagdq4em