Filters








29 Hits in 10.4 sec

Page 5885 of Mathematical Reviews Vol. , Issue 99h [page]

1999 Mathematical Reviews  
(J-CHOF-IF; Chofu) A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes.  ...  Summary: “In this paper we propose a fast erasure-and-error de- coding method for any one-point algebraic-geometric (AG) codes up to the Feng-Rao bound, which is a modification of the Sakata algorithm  ... 

Page 1449 of Mathematical Reviews Vol. , Issue 99b [page]

1991 Mathematical Reviews  
Kuz’/min], Trace-function on a Galois ring in coding theory (277-290); Shojiro Sakata, A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes (291-  ...  The bounds are in terms of the dimension n and the coding gain y of L, and are obtained based on a decoding algorithm which is an improved version of Kannan’s  ... 

Error correcting codes and spatial coupling [article]

Rafah El-Khatib, Jean Barbier, Ayaka Sakata, Rüdiger Urbanke
2014 arXiv   pre-print
The first three sections cover the basics of polar codes and low density parity check codes. In the last three sections, we see how the spatial coupling helps belief propagation decoding.  ...  These are notes from the lecture of R\"udiger Urbanke given at the autumn school "Statistical Physics, Optimization, Inference, and Message-Passing Algorithms", that took place in Les Houches, France from  ...  The MAP decoder outputs the mode of the posterior distribution and thus minimizes the block-error probability. This is why we would like to implement it.  ... 
arXiv:1409.7465v1 fatcat:6fbnfbdyxraafoopdu5uzmeiyy

On the decoding of algebraic-geometric codes

T. Hoholdt, R. Pellikaan
1995 IEEE Transactions on Information Theory  
This paper provides a survey of the existing literature on the decoding of algebraic-geometric codes. Definitions, theorems and cross references will be given.  ...  We show what has been done, discuss what still has to be done and pose some open problems. The following subjects are examined in a more or less historical order. * Manuscript  ...  This has dramatically changed after the development of chip technology and fast decoding algorithms, the application to the compact disc player and the error-correction in deep space information transmission  ... 
doi:10.1109/18.476214 fatcat:xlmzq64klnbs3dm3wvxhi7cgfm

Channel Coding: The Road to Channel Capacity [article]

Daniel J. Costello Jr., G. David Forney Jr
2006 arXiv   pre-print
We focus on the contributions that have led to the most significant improvements in performance vs. complexity for practical applications, particularly on the additive white Gaussian noise (AWGN) channel  ...  We trace the antecedents of today's capacity-approaching codes: convolutional codes, concatenated codes, and other probabilistic coding schemes.  ...  ACKNOWLEDGMENTS The authors would like to thank Mr. Ali Pusane for his help in the preparation of this manuscript. Comments on earlier drafts by C. Berrou, J. L. Massey, and R.  ... 
arXiv:cs/0611112v1 fatcat:iwrrtx7mpfhgzfenehztfi5vyy

Channel coding: The road to channel capacity

Daniel J. Costello, G. David Forney
2007 Proceedings of the IEEE  
We focus on the contributions that have led to the most significant improvements in performance versus complexity for practical applications, particularly on the additive white Gaussian noise channel.  ...  We trace the antecedents of today's capacity-approaching codes: convolutional codes, concatenated codes, and other probabilistic coding schemes.  ...  Acknowledgment The authors would like to thank A. Pusane for his help in the preparation of this manuscript. Comments on earlier drafts by C. Berrou, J. L. Massey, and R. Urbanke were very helpful.  ... 
doi:10.1109/jproc.2007.895188 fatcat:pftdplkbergcbpkra6ddfwjtpa

Privacy and Security Assessment of Biometric Template Protection

Xuebing Zhou
2012 it - Information Technology  
The coding process plays a very important role for the security and privacy properties in the fuzzy commitment scheme. Designing a coding method should not only focus on the improvement of code rate.  ...  The iris recognition is based on an open source algorithm using Gabor filter. It is implemented in the fuzzy commitment scheme with the two layer coding method as proposed by Hao et al.  ...  The iris template consists of a binary code B and a mask vector Bm. The mask vector shows noisy positions in the iris code. During the enrolment, the template is stored in a data storage.  ... 
doi:10.1524/itit.2012.0676 fatcat:2pypoukudnezxpsr6zyulkodh4

Secure Cloud Storage Protocols with Data Dynamics Using Secure Network Coding [article]

Binanda Sengupta and Akanksha Dixit and Sushmita Ruj
2018 arXiv   pre-print
To the best of our knowledge, DSCS I is the first secure cloud storage protocol for dynamic data that is based on a secure network coding protocol and that is secure in the standard model.  ...  based on a secure network coding protocol.  ...  [19] (using replication of data) and Bowers et al. [11] (using error-correcting codes and erasure codes). Dimakis et al.  ... 
arXiv:1612.08029v6 fatcat:xzkrmw2havfddjgqwo63bino7u

Page 2378 of Mathematical Reviews Vol. 31, Issue Index [page]

Mathematical Reviews  
Codes on superelliptic curves. (English summary) 99j:11071 Sakata, Shojiro A vector version of the BMS algorithm for implementing fast erasure-and- error decoding of one-point AG codes.  ...  ., 99h:94066 Kotter, Ralf A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes.  ... 

Multiple-Description Lattice Vector Quantization [article]

Jan Ostergaard
2007 arXiv   pre-print
In this thesis, we construct and analyze multiple-description codes based on lattice vector quantization.  ...  It may be noticed from Fig. 1.1 that Decoder 0 and Decoder 1 are located on the sides of Decoder c and it is therefore customary to refer to Decoder 0 and Decoder 1 as the side decoders and Decoder c  ...  We use the term admissible K-tuple for any set of K code vectors (λ 0 , . . . , λ K−1 ) which is obtained by applying the index-assignment map on a code vector λ c , i.e. α(λ c ) = (λ 0 , . . . , λ K−1  ... 
arXiv:0707.2482v1 fatcat:aajq3eccnfakfp3u5t5oh4b6qy

Fundamentals of Cryptology [chapter]

2006 Security in Fixed and Wireless Networks  
RSA for Privacy and Signing 9  ...  How to Take Discrete Logarithms 8.3.1 The Pohlig-Hellman Algorithm Special Case: q 1 2 n General Case: q 1 has only small prime factors An Example of the Pohlig-Hellman Algorithm 8.3.2 The Baby-Step Giant-Step  ...  We owe to him the notations f(x) (1734), e for the base of natural logs (1727), i for the square root of -1 (1777), p for pi, ⁄for summation (1755) etc.  ... 
doi:10.1002/0470863722.ch2 fatcat:3qnksbbsara6vl5fdzynloehcy

From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography [article]

Arash Atashpendar
2020 arXiv   pre-print
From the output produced by a memoryless deletion channel with a uniformly random input of known length n, one obtains a posterior distribution on the channel input.  ...  We then establish a connection between covert communication and deniability to propose DC-QKE, a simple and provably secure construction for coercer-deniable QKE.  ...  Wilde and Ignatius William Primaatmaja for their comments. Further Applications of Covert Communication for Deniability  ... 
arXiv:2003.11663v1 fatcat:7ul4q6mupjcyzfyspus6xwh2ai

Cooperating error-correcting codes and their decoding [article]

LMGM Ludo Tolhuizen, JH Van Lint, HCA Henk Van Tilborg
1996
Acknowledgements 142 Acknowledgement The authors thank their colleague A.J.E.M. 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. Koppelaar and J.H. van Lint for many stimulating discussions.  ...  We describe the set of error patterns that are decoded by the mBM algorithm for a given BCH code in terms of sets of error patterns that are decoded by the Berlekamp-Massey (BM) algorithm for related BCH  ... 
doi:10.6100/ir462079 fatcat:uol5b54ibneaxir2dwj3fwcri4

Page 1517 of Mathematical Reviews Vol. 31, Issue Index [page]

Mathematical Reviews  
Kim) 99m:11057 11F55 (11F25) Sakata, Shojiro A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes.  ...  (Summary) 99h:94071 94B35 (94B27) — (with Leonard, Douglas A.; Jensen, Helge Elbrond; Hoholdt, Tom) Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound.  ... 

Coding for Communications and Secrecy

Mani Bastaniparizi
2017
Thus, we showed that the block code defined by a terminated version of Algorithm 8 is indeed a good resolvability code.  ...  A hardware implementation of the decoder by using the LLR-based formulation of the algorithm is up to 50% faster and around 30% smaller than the previous implementations of the decoder, due to the smaller  ...  Using the above in (7.31), we get Converse for Variable-to-Fixed-Length Codes Now suppose we have a variable-to-fixed-length code, that maps T (a random number of) independently drawn input words J  ... 
doi:10.5075/epfl-thesis-7751 fatcat:hjjgntnf35astazoouuwg6lgh4
« Previous Showing results 1 — 15 out of 29 results