Filters








1,713 Hits in 9.1 sec

White-Box Cryptography and an AES Implementation [chapter]

Stanley Chow, Philip Eisen, Harold Johnson, Paul C. Van Oorschot
2003 Lecture Notes in Computer Science  
The intent is to hide the key by a combination of encoding its tables with random bijections representing compositions rather than individual steps, and extending the cryptographic boundary by pushing  ...  Conventional software implementations of cryptographic algorithms are totally insecure where a hostile user may control the execution environment, or where co-located with malicious software.  ...  We thank Alexander Shokurov for suggesting the ambiguity metric of §4.2 in another context, and anonymous reviewers.  ... 
doi:10.1007/3-540-36492-7_17 fatcat:yih6rtt4y5ejfjz3ywvxhte6ga

Message encoding for spread and orbit codes

Anna-Lena Trautmann
2014 2014 IEEE International Symposium on Information Theory  
In this work we show how the message space can be chosen for a given code and how message en- and decoding can be done.  ...  These codes have been well-studied for their error correction capability and transmission rate, but the question of how to encode messages has not been investigated.  ...  In this section we want to combine the message en-and decoder for Desarguesian spread codes with the error correction enand decoder for orbit codes, which we call a hybrid en-and decoder for spread codes  ... 
doi:10.1109/isit.2014.6875303 dblp:conf/isit/Trautmann14 fatcat:za6irvaegvhylkdu2biqk7rd2e

iFlow: Numerically Invertible Flows for Efficient Lossless Compression via a Uniform Coder [article]

Shifeng Zhang, Ning Kang, Tom Ryder, Zhenguo Li
2021 arXiv   pre-print
Furthermore, the techniques presented in this paper can be used to accelerate coding time for a broad class of flow-based algorithms.  ...  As such, we introduce iFlow, a new method for achieving efficient lossless compression.  ...  We use a batch size of 64. flow compression encoding time (ms) decoding time (ms) arch. technique nll bpd aux. bits inference coding inference coding Flow++ LBB [17] iFlow (Ours) 3.871 3.875 3.873 45.96  ... 
arXiv:2111.00965v1 fatcat:xrzkbyr4tzblbaxueyiozixsoe

An algebraic framework for concatenated linear block codes in side information based problems

Felipe Cinelli Barbosa, Jorg Kliewer, Max H. M. Costa
2012 2012 IEEE International Symposium on Information Theory Proceedings  
This work provides an algebraic framework for source coding with decoder side information and its dual problem, channel coding with encoder side information, showing that nested concatenated codes can  ...  rate-distortion bound for a Bernoulli symmetric source, we illustrate our findings with a new algebraic construction which comprises concatenated nested cyclic codes and binary linear block codes.  ...  limit of list decodability, with encoding and decoding performed in polynomial time.  ... 
doi:10.1109/isit.2012.6283538 dblp:conf/isit/BarbosaKC12 fatcat:kg5ry4p2qjbotjeqc6i6pz4lhu

An Algebraic Framework for Concatenated Linear Block Codes in Side Information Based Problems [article]

Felipe Cinelli Barbosa, Joerg Kliewer, Max H. M. Costa
2012 arXiv   pre-print
This work provides an algebraic framework for source coding with decoder side information and its dual problem, channel coding with encoder side information, showing that nested concatenated codes can  ...  By observing that list decoding with folded Reed- Solomon codes is asymptotically optimal for encoding IID q-ary sources and that in concatenation with inner binary codes it can asymptotically achieve  ...  limit of list decodability, with encoding and decoding performed in polynomial time.  ... 
arXiv:1204.5253v1 fatcat:222f7hlrvbeidk7kxu2nnn5kyi

Message encoding and retrieval for spread and cyclic orbit codes

Anna-Lena Horlemann-Trautmann
2017 Designs, Codes and Cryptography  
In this work we show how a message set of consecutive integers can be encoded and retrieved for these two code families.  ...  These codes have been wellstudied for their error correction capability, transmission rate and decoding methods, but the question of how to encode and retrieve messages has not been investigated.  ...  ACKNOWLEDGMENT The author would like to thank Yuval Cassuto for his reference to enumerative coding.  ... 
doi:10.1007/s10623-017-0377-x fatcat:taubfpo3sfbu3ikcj5vql6muqa

Designing communication systems via iterative improvement: error correction coding with Bayes decoder and codebook optimized for source symbol error [article]

Chai Wah Wu
2021 arXiv   pre-print
We provide numerical experiments to show that they can be superior to classical linear block codes such as Hamming codes and decoding methods such as minimum distance decoding.  ...  For error correction, we look at ECC from a Bayesian perspective and introduce Bayes estimators with general loss functions to take into account the bit significance.  ...  The storage encoding corresponds to a bijection σ from N k to S k , i.e. there are k! different encodings σ possible.  ... 
arXiv:1805.07429v5 fatcat:ziah6lqzufaylcvhyupzli7o5e

Efficient Codes for Adversarial Wiretap Channels [article]

Pengwei Wang, Reihaneh Safavi-Naini
2014 arXiv   pre-print
In this paper we give the first efficient construction of a capacity achieving code family that provides perfect secrecy for this channel.  ...  In [13] we proposed a (ρ_r , ρ_w )-adversarial wiretap channel model (AWTP) in which the adversary can adaptively choose to see a fraction ρ_r of the codeword sent over the channel, and modify a fraction  ...  [8] , gives an explicit construction for list decodable codes that achieve the list decoding capacity ρ = 1 − R − ε. The code has polynomial time encoding and decoding algorithms.  ... 
arXiv:1401.4633v1 fatcat:ri2foji6w5bbzjjireb2abguu4

Message Encoding and Retrieval for Spread and Cyclic Orbit Codes [article]

Anna-Lena Horlemann-Trautmann
2016 arXiv   pre-print
In this work we show how a message set of consecutive integers can be encoded and retrieved for these two code families.  ...  These codes have been well-studied for their error correction capability, transmission rate and decoding methods, but the question of how to encode and retrieve messages has not been investigated.  ...  ACKNOWLEDGMENT The author would like to thank Yuval Cassuto for his reference to enumerative coding, John Sheekey for his advice on Desarguesian spreads, and Margreta Kuijper for fruitful discussions and  ... 
arXiv:1409.0610v3 fatcat:6xkj6kwbfjevtfszai3eejhv5m

Design Criteria for Linear Precoders based on a Bitwise Capacity Argument

Frederik Simoens, Henk Wymeersch, Marc Moeneclaey
2006 2006 IEEE International Symposium on Information Theory  
The use of linear precoding in Bit-Interleaved Coded Modulation with iterative decoding leads to a significant performance improvement on AWGN channels.  ...  We compute the bitwise capacity as seen by each of the precoder inputs in order to investigate the impact of precoding for two scenarios: using (i) a non-iterative decoder and (ii) an iterative decoder  ...  The linear precoder is described by a k × n injective binary generator matrix G (with n ≥ k): v l = u l G. (1) The coding rate of the precoder is denoted by r p = k/n.  ... 
doi:10.1109/isit.2006.261689 dblp:conf/isit/SimoensWM06 fatcat:m667uazldjhp7ad3snbmf3qseu

On q-ary antipodal matchings and applications

Erik Ordentlich, Ron M. Roth, Gadiel Seroussi
2012 2012 IEEE International Symposium on Information Theory Proceedings  
resistive memories; crossbar memories; Boolean threshold functions; weight-constrained codes; two-dimensional coding We define a q-ary antipodal matching to be a perfect matching in the bipartite graph  ...  Such encoders might be useful for mitigating parasitic currents in a next generation memory technology based on crossbar arrays of resistive devices.  ...  Of interest are codes for which the encoder and decoder can be computed with low complexity and C is as large as possible.  ... 
doi:10.1109/isit.2012.6283027 dblp:conf/isit/OrdentlichRS12 fatcat:lqyuv5ozsjge7k7q2fb5pnwywe

Capacity-Approaching Constrained Codes with Error Correction for DNA-Based Data Storage [article]

Tuan Thanh Nguyen, Kui Cai, Kees A. Schouhamer Immink, Han Mao Kiah
2020 arXiv   pre-print
In particular, for given ℓ, ϵ > 0, we propose simple and efficient encoders/decoders that transform binary sequences into DNA base sequences (codewords), namely sequences of the symbols A, T, C and G,  ...  Our methods have low encoding/decoding complexity and limited error propagation.  ...  We now show that the suffix can be encoded and decoded in linear time without the use of a lookup table.  ... 
arXiv:2001.02839v1 fatcat:dsqc6zs4e5awretjswwcvmsg2i

Layered schemes for large-alphabet secret key distribution

Hongchao Zhou, Ligong Wang, G. Wornell
2013 2013 Information Theory and Applications Workshop (ITA)  
bit layers, and to then encode all the bit layers either independently or jointly using binary codes.  ...  We introduce and study a simple scheme called layered scheme, which can be treated as a variant of coded modulation.The idea of layered schemes is to first split the observed large-alphabet symbols into  ...  In practice, Slepian-Wolf codes are often constructed from linear channel codes. Specifically, let C be a linear code with a parity-check matrix H.  ... 
doi:10.1109/ita.2013.6502993 dblp:conf/ita/ZhouWW13 fatcat:vbtuoj6kmfecfl2a6tey5tdxsa

Successive-Cancellation Decoding of Linear Source Code [article]

Jun Muramatsu
2019 arXiv   pre-print
This paper investigates the error probability of several decoding methods for a source code with decoder side information, where the decoding methods are: 1) symbol-wise maximum a posteriori decoding,  ...  Furthermore, we revisit the polar source code showing that stochastic successive-cancellation decoding, as well as successive-cancellation decoding, is effective for this code.  ...  K. Iwata, and Dr. Y. Sakai for helpful discussions.  ... 
arXiv:1903.11787v4 fatcat:qyrilisvwfhmdg4isotb73to5a

A Combination of Testability and Decodability by Tensor Products [article]

Michael Viderman
2011 arXiv   pre-print
relative distance; have blocklength n and testable with n^ϵ queries, for any constant ϵ > 0; linear time encodable and linear-time decodable from a constant fraction of errors.  ...  Ben-Sasson and Sudan (RSA 2006) showed that repeated tensor products of linear codes with a very large distance are locally testable.  ...  Acknowledgements We thank Eli Ben-Sasson and Or Meir for helpful discussions. The author thanks also Eli Ben-Sasson for many invaluable discussions regarding the "robustness" concept.  ... 
arXiv:1105.5806v1 fatcat:hbklsosbmnfsrf5vte2pefik5y
« Previous Showing results 1 — 15 out of 1,713 results