Filters








3,833 Hits in 6.4 sec

The Performance Evaluation of Recon_Gurable Random Interleavers with MAP Decoding for MPEG-4Medical Image Transmission Systems over Indoor Wireless Channels

Srijidtra Mahapakulchai, Nirawit Sutavimol
<span title="">2013</span> <i title="EJournal Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hvh5w7m2xzcrhkbhz4hppekzju" style="color: black;">International Journal of Future Computer and Communication</a> </i> &nbsp;
Thus, the source transition probability matrix (STPM) used in a MAP decoding process can be computed and configured at the Viterbi receiver in advance.  ...  Moreover, to overcome the burst noise transmission problem, we employ a ring convolutional encoder with reconfigurable random inter-leavers.  ...  If the random variables , , … , of the process are independent but not identically distributed. We obtain , , … , ∑ , where is the entropy of a discrete random variable .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7763/ijfcc.2013.v2.180">doi:10.7763/ijfcc.2013.v2.180</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/szqc63hol5epdawuhbxzxeagtm">fatcat:szqc63hol5epdawuhbxzxeagtm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829222023/http://www.ijfcc.org/papers/180-C038.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/68/9b/689bf862568caf8305ac7fe89d5ef669098d481d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7763/ijfcc.2013.v2.180"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Partial iterative decoding for binary turbo codes via cross-entropy based bit selection

Jinhong Wu, Zhengdao Wang, Branimir Vojcic
<span title="">2009</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dha3bnxvkvhslj74k332qi2ewa" style="color: black;">IEEE Transactions on Communications</a> </i> &nbsp;
Near-capacity performance of turbo codes is generally achieved with a large number of decoding iterations. Various iteration stopping rules introduced in the literature often induce performance loss.  ...  The overall complexity and memory requirements of the new algorithm are evaluated and compared with known algorithms.  ...  SIMULATIONS The performance of a turbo code is generally driven by encoder memory length, interleaver length, and channel conditions [10] , [18] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcomm.2009.11.080182">doi:10.1109/tcomm.2009.11.080182</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bu4nzj43djeanit2dflnrfuipu">fatcat:bu4nzj43djeanit2dflnrfuipu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830003857/http://renyi.ece.iastate.edu/zhengdao/publications/papers/wuwv09.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/97/be/97be89740c993ac811f71f5a6b1f20a43ff6e2c1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcomm.2009.11.080182"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Adaptable recursive binary entropy coding technique

Aaron B. Kiely, Matthew A. Klimesh, Zia-ur Rahman, Robert A. Schowengerdt, Stephen E. Reichenbach
<span title="2002-07-31">2002</span> <i title="SPIE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4qwqcfvnf5ctxfnjmk2enhvbaq" style="color: black;">Visual Information Processing XI</a> </i> &nbsp;
Recursive interleaved entropy coding may have advantages over arithmetic coding, including most notably the admission of a simple and fast decoder.  ...  We preseiit a novel data coinpression technique, called recursive interleaved entropy coding, tliat is based on recursive interleaving of variahle-to-va.riable length binary source codes.  ...  ACKNOWLEDGMENTS The work described was funded by the IPN-ISD Technology Program and performed at the Jet Propulsion Laboratory, California Institute of Technology under contract with the National Aeronautics  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1117/12.477575">doi:10.1117/12.477575</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spieVIP/KielyK02.html">dblp:conf/spieVIP/KielyK02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mfxln3usdbdjtpp6stifu3qfju">fatcat:mfxln3usdbdjtpp6stifu3qfju</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100527001733/http://trs-new.jpl.nasa.gov/dspace/bitstream/2014/11852/1/02-0527.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d3/0b/d30b994c2f7e0050c9cb8b54811630dbda11d8ba.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1117/12.477575"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Get Out of the Valley: Power-Efficient Address Mapping for GPUs

Yuxi Liu, Xia Zhao, Magnus Jahre, Zhenlin Wang, Xiaolin Wang, Yingwei Luo, Lieven Eeckhout
<span title="">2018</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2kokby3zfzen3bd62o6cskolxq" style="color: black;">2018 ACM/IEEE 45th Annual International Symposium on Computer Architecture (ISCA)</a> </i> &nbsp;
Using this metric, we find that GPU-compute workloads exhibit entropy valleys distributed throughout the lower order address bits.  ...  This indicates that efficient GPU-address mapping schemes need to harvest entropy from broad address-bit ranges and concentrate the entropy into the bits used for channel and bank selection in the memory  ...  Bit flip rate is difficult to apply to a GPU as memory requests from different TBs are generated in parallel. Hence, they interleave in many different ways, causing unreliable bit flip measurements.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isca.2018.00024">doi:10.1109/isca.2018.00024</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/isca/LiuZJWWLE18.html">dblp:conf/isca/LiuZJWWLE18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3elbfyze4zdexccs7sgq26cvea">fatcat:3elbfyze4zdexccs7sgq26cvea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430133901/https://ntnuopen.ntnu.no/ntnu-xmlui/bitstream/handle/11250/2583165/liu-isca18-author-copy.pdf?sequence=4" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/92/ff/92ff50f93800bc457e35f24ad6c3356e8fc50f80.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isca.2018.00024"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Partial iterative equalization and channel decoding

Jinhong Wu, Branimir Vojcic
<span title="">2009</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rc5jnc4ldvhs3dswicq5wk3vsq" style="color: black;">2009 IEEE International Conference on Acoustics, Speech and Signal Processing</a> </i> &nbsp;
The rapid decrease in selected bits after each such iteration reduces computational complexity significantly, but performance is well maintained by utilizing the Markov property in the trellis detection  ...  The receiver starts with conventional iterative channel equalization and decoding. After each iteration, bit convergence status is measured via cross-entropy.  ...  In the second case, the turbo code employs two identical RSC (7, 5) encoders to produce a puctured, half rate code. A random interleaver of length 2048 is also applied before modulation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icassp.2009.4960169">doi:10.1109/icassp.2009.4960169</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icassp/WuV09.html">dblp:conf/icassp/WuV09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kgybysxoc5hmdkmpc63dffexee">fatcat:kgybysxoc5hmdkmpc63dffexee</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814123055/http://mirlab.org/conference_papers/International_Conference/ICASSP%202009/pdfs/0002657.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/55/92/5592ada522c5820c82ed6eaa2586d9dd08d876ca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icassp.2009.4960169"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

QUAC-TRNG: High-Throughput True Random Number Generation Using Quadruple Row Activation in Commodity DRAM Chips [article]

Ataberk Olgun, Minesh Patel, A. Giray Yağlıkçı, Haocong Luo, Jeremie S. Kim, Nisa Bostancı, Nandita Vijaykumar, Oğuz Ergin, Onur Mutlu
<span title="2021-05-25">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our experimental evaluations show that QUAC-TRNG generates true random numbers with a throughput of 3.44 Gb/s (per DRAM channel), outperforming the state-of-the-art DRAM-based TRNG by 15.08x and 1.41x  ...  True random number generators (TRNG) sample random physical processes to create large amounts of random numbers for various use cases, including security-critical cryptographic primitives, scientific simulations  ...  Acknowledgements We thank the anonymous reviewers of ISCA 2021 for feedback and the SAFARI group members for feedback and the stimulating intellectual environment they provide.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.08955v2">arXiv:2105.08955v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/64w37n2ymbbapoe4x4v4dd4tpm">fatcat:64w37n2ymbbapoe4x4v4dd4tpm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210529234033/https://arxiv.org/pdf/2105.08955v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/41/d441e66baa101273fc5323a1fb05f5141f5a8a51.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2105.08955v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Page 5401 of Mathematical Reviews Vol. , Issue 86k [page]

<span title="">1986</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
The number H(0,T) = inf .<3(9) H(p/0,T) is called the entropy of the uncertainty space (0,T).  ...  Author summary (translated from the Russian): “We consider several modulation and coding systems for a Gaussian channel without memory.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1986-11_86k/page/5401" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1986-11_86k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

An Entropy Maximizing Geohash for Distributed Spatiotemporal Database Indexing [article]

Taylor Arnold
<span title="2015-06-16">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a modification of the standard geohash algorithm based on maximum entropy encoding in which the data volume is approximately constant for a given hash prefix length.  ...  Distributed spatiotemporal databases, which typically require interleaving spatial and temporal elements into a single key, reap large benefits from a balanced geohash by creating a consistent ratio between  ...  Assume {z i } N i=0 is a set of independent samples from realizations of the random variable F.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1506.05158v1">arXiv:1506.05158v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kuvf7poiynggvlw2v5j7ii4bze">fatcat:kuvf7poiynggvlw2v5j7ii4bze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200830085547/https://arxiv.org/pdf/1506.05158v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/42/4c/424c09aa3ac0b50e5663fcbdd275882b046d7f18.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1506.05158v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Block Markov Superposition Transmission: Construction of Big Convolutional Codes from Short Codes [article]

Xiao Ma, Chulong Liang, Kechao Huang, Qiutao Zhuang
<span title="2013-08-22">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
A construction of big convolutional codes from short codes called block Markov superposition transmission (BMST) is proposed.  ...  More importantly, the performance of BMST can be simply lower-bounded in terms of the transmission memory given that the performance of the short code is available.  ...  The authors are with the Department of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou 510006, China (e-mail: maxiao@mail.sysu.edu.cn, lchul@mail2.sysu.edu.cn, hkech@mail2.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1308.4809v1">arXiv:1308.4809v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/my6pskra7bfpvlwpxsvxu7lmcy">fatcat:my6pskra7bfpvlwpxsvxu7lmcy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191021031720/https://arxiv.org/pdf/1308.4809v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fb/35/fb35cfff08ed5efd42aec81f08438967bc463fa0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1308.4809v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding

Igal Sason, Shlomo Shamai
<span title="">2000</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/33pv7cskifexlbh6yhnbxtshsa" style="color: black;">Transactions on Emerging Telecommunications Technologies</a> </i> &nbsp;
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice over the interleaver and  ...  a uniform choice of the component codes from the set of time varying recursive systematic convolutional codes.  ...  We are indebted to James Massey for his very constructive comments, for providing reference [11] and an elegant alternative way to evaluate the mean activity time, which is incorporated in the text.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/ett.4460110304">doi:10.1002/ett.4460110304</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iapqze7hdfds7jgsokmoog6o2a">fatcat:iapqze7hdfds7jgsokmoog6o2a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130930083021/http://webee.technion.ac.il/people/sason/union_bounds.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/13/93/13939c68c08b8354941ae40764d424158eedb9b0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/ett.4460110304"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Mapping the File Systems Genome: rationales, technique, results and applications [article]

Roberto Di Pietro, Luigi V.Mancini, Antonio Villani, Domenico Vitali
<span title="2013-06-12">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
It appears from our study that the File System Genome is a distinctive and unique feature of each indi- vidual HDD.  ...  The results provided in this paper constitute the scientific basis for a number of applications in various fields of information technology, such as forensic identification and security.  ...  Min-entropy captures the amount of randomness that can be provided by a given distribution.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1306.2833v1">arXiv:1306.2833v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vl5xm3scavfyljd2vybtbigqbi">fatcat:vl5xm3scavfyljd2vybtbigqbi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200822061708/https://arxiv.org/pdf/1306.2833v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/80/51/8051527a04eab5906f967da519364d76e6ccbba7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1306.2833v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Multiplexed Quantum Random Number Generation

Ben Haylock, Daniel Peace, Francesco Lenzini, Christian Weedbrook, Mirko Lobino
<span title="2019-05-13">2019</span> <i title="Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rn7grw3445fj7nbqt6ouuaxz2m" style="color: black;">Quantum</a> </i> &nbsp;
We obtain a real-time random number generation rate of 3.08 Gbit/s, from only 27.5 MHz of sampled detector bandwidth.  ...  Here we use a multiplexing scheme to create a fast quantum random number generator structurally tailored to encryption for distributed computing, and high bit-rate data transfer.  ...  Programme.This work was performed in part at the Queensland node of the Australian National Fabrication Facility, a company established under the National Collaborative Research Infrastructure Strategy  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22331/q-2019-05-13-141">doi:10.22331/q-2019-05-13-141</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nvlahvmszrbsbiebrymc7iz7xq">fatcat:nvlahvmszrbsbiebrymc7iz7xq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200508165843/https://research-repository.griffith.edu.au/bitstream/handle/10072/387074/Haylock157271.pdf;jsessionid=3AB10060A6FDCF885E60A98EEDEB1D97?sequence=2" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/22/e0/22e0724ead6badc2176d88dce9ef62205b88053c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22331/q-2019-05-13-141"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More [article]

Eshan Chattopadhyay, Xin Li
<span title="2018-11-02">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Non-malleable codes were introduced by Dziembowski, Pietrzak, and Wichs (JACM 2018) as a generalization of standard error correcting codes to handle severe forms of tampering on codewords.  ...  in theoretical computer science.  ...  Next, we fix LExt 2 (Y, S) without affecting the distribution of LExt 2 (X, S). It follows that LExt 2 (Z, S) is 2 −n Ω(1) -close to uniform. This completes the proof of Theorem 7.1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.05228v2">arXiv:1804.05228v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tuahswudg5f3vionqvs2ie3lr4">fatcat:tuahswudg5f3vionqvs2ie3lr4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200823210411/https://arxiv.org/pdf/1804.05228v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d5/c2/d5c2f7c3943b339f2b83b6fbb2dbdd69a79fc66d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.05228v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Welcome to the Entropics: Boot-Time Entropy in Embedded Devices

K. Mowery, M. Wei, D. Kohlbrenner, H. Shacham, S. Swanson
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/inod5dqjxfdj3bnjykkklcg7d4" style="color: black;">2013 IEEE Symposium on Security and Privacy</a> </i> &nbsp;
It is simple to implement and has a negligible runtime overhead, but, on many of the devices we test, gathers hundreds of bits of entropy.  ...  We implement and measure the effectiveness of our techniques on ARM-, MIPS-, and AVR32-based systems-on-a-chip from a variety of vendors. Test RPi BB Trim-Slice Dragon Board Mini-6410 Cubox WRT NGW  ...  This material is based upon work supported by the National Science Foundation under Grants No. CNS-0831532, CNS-0964702, DGE-1144086, and by the MURI program under AFOSR Grant No. FA9550-08-1-0352.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sp.2013.46">doi:10.1109/sp.2013.46</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sp/MoweryWKSS13.html">dblp:conf/sp/MoweryWKSS13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2pph5trrjzd63dnjhs6ecni6my">fatcat:2pph5trrjzd63dnjhs6ecni6my</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811160638/http://cseweb.ucsd.edu/~swanson/papers/Oakland2013EarlyEntropy.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/41/f7/41f70f70eaed925d71fab6d1d67a5ade4bfd9de0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sp.2013.46"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

End-To-End Design of a PUF-Based Privacy Preserving Authentication Protocol [chapter]

Aydin Aysu, Ege Gulcan, Daisuke Moriyama, Patrick Schaumont, Moti Yung
<span title="">2015</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We show how to obtain efficient implementations for each of the building blocks of the protocol, including a fuzzy extractor with a novel helper-data construction technique, a truly random number generator  ...  The prototype is implemented on a SASEBO-GII board, using the on-board SRAM as the source of entropy for the PUF and the TRNG. We present three different implementations.  ...  . ∀1 ≤ j ≤ , |S 2-j-5 − S 2-j-6 | ≤ 2 • Adv PRF B (k) for a PPT algorithm B. (Truly Random Number Generator) TRNG derives a truly random number sequence.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-48324-4_28">doi:10.1007/978-3-662-48324-4_28</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fhmywbr5mvbelkci34magnxzpq">fatcat:fhmywbr5mvbelkci34magnxzpq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160603135719/https://eprint.iacr.org/2015/937.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d8/33/d833d843bcd7df253cd093c8d531cbdaa574a85d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-48324-4_28"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 3,833 results