A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
On the Success Probability of Decoding (Partial) Unit Memory Codes
[article]
2017
arXiv
pre-print
Preserved Fulltext
In this paper, we derive analytic expressions for the success probability of decoding (Partial) Unit Memory codes in memoryless channels. ...
An applications of this result is that these codes outperform individual block codes in certain channels. ...
If k < k 1 , the resulting code is called (n, k|k 1 ) partial unit memory code since the current codeword c t contains parts of the previous information word i t−1 . ...
arXiv:1705.08652v1
fatcat:xogoa2225vedrj4i7jrgshstny
Partial network coding
2008
ACM transactions on sensor networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this article, we present partial network coding (PNC) as a generic tool for these applications. ...
We prove that the performance of PNC is quite close to NC, except for a sub-linear overhead on storage and communications. We then address a set of J. 14:2 • D. ...
ACKNOWLEDGMENTS The authors thank Dr. Wenjie Wang for valuable discussions. ...
doi:10.1145/1362542.1362545
fatcat:imijaxfqjvaofdrhpdd5zm2764
Partial iterative decoding for binary turbo codes via cross-entropy based bit selection
2009
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
We first establish decoding optimality of windowed partial iteration for non-converged bits given that convergence has been achieved on window boundaries. ...
In Partial-I, one more memory unit is needed to store the value ( 1 / ) ⋅ 10 −3 ; in Partial-II, 0 more units are needed for 1 ( ) ⋅ 10 −3 's for the non-converged bits, and one unit for ( 1 / ) ⋅ 10 − ...
doi:10.1109/tcomm.2009.11.080182
fatcat:bu4nzj43djeanit2dflnrfuipu
Improved trellis-coding for partial-response channels
1995
IEEE transactions on magnetics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
of two, relative to previously reported codes, while retaining the other attractive features of MSN codes. ...
The methods, which extend the matched-spectral-null (MSN) coding technique, use novel code constraints and time-varying detector trellis structures to reduce path memory requirements by as much as a factor ...
For those codes, the path memory requirement is 24 symbols, and the encoder/decoder functions are considerably more complex than those of the new code. ...
doi:10.1109/20.364798
fatcat:p5jpiye4wvhdtjicfyllztjspm
PR-NN: RNN-based Detection for Coded Partial-Response Channels
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The recording system on which the experiments were conducted uses a rate-2/3, (1,7) runlength-limited (RLL) code with an E2PR4 partial-response channel target. ...
We refer to the proposed detection method, which is intended for recording channels with partial-response equalization, as Partial-Response Neural Network (PR-NN). ...
In practice, we exploit more sophisticated recurrent hidden units that implement a gating mechanism [5] , [7] , such as long short-term memory (LSTM) units [13] and gated recurrent units (GRUs) [6 ...
arXiv:2007.15695v1
fatcat:oztpivyirrcehpqce2mwdbk7hu
Partial Network Coding: Theory and Application for Continuous Sensor Data Collection
2006
IEEE International Workshop on Quality of Service, IWQoS
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present partial network coding (PNC) as a generic tool for the above applications. ...
We prove that the performance of PNC is quite close to NC, except for a sublinear overhead on storage and communications. ...
Our coding scheme enables the combination of only part of the original data segments, and we refer to it as Partial Network Coding (PNC), cf. network coding (NC) and no network coding at all (Non-NC). ...
doi:10.1109/iwqos.2006.250455
dblp:conf/iwqos/WangZL06
fatcat:e4sfjrzjsje2ppsdnogf2pz4ua
Deep Active Inference for Partially Observable MDPs
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The deep learning architecture optimizes a variant of the expected free energy and encodes the continuous state representation by means of a variational autoencoder. ...
We show, in the OpenAI benchmark, that our approach has comparable or better performance than deep Q-learning, a state-of-the-art deep reinforcement learning algorithm. ...
The memory buffer stores transitions from which the agent can sample random batches on which to perform batch gradient descent. ...
arXiv:2009.03622v1
fatcat:ihh4trskzjfqxda4ns5gxnd7wm
Optimal Broadcast with Partial Knowledge
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
This work concerns the problem of broadcasting a large message efficiently when each processor has partial prior knowledge about the contents of the broadcast message. ...
The problem of Broadcast with Partial Knowledge (BPK) was introduced in the context of Topology Update -the task of updating network nodes about the network topology after topological changes. ...
It is conceivable that the faults cause only partial changes in memory, so our algorithm can be used to mend the situation. ...
doi:10.1007/bfb0022142
fatcat:njn2r5pucfawhagrht3wkicrcu
Coded sparse matrix computation schemes that leverage partial stragglers
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this work we present schemes that allow us to leverage partial computation by stragglers while imposing constraints on the level of coding that is required in generating the encoded submatrices. ...
Coded computation utilizes concepts from erasure coding to mitigate the effect of stragglers by running 'coded' copies of tasks comprising a job; stragglers are typically treated as erasures. ...
By Lemma 2 the decoding is successful. ...
arXiv:2012.06065v2
fatcat:47k3sh7pczgsnniegde6ykaa64
Partially Blind Instantly Decodable Network Codes for Lossy Feedback Environment
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study the multicast completion and decoding delay minimization problems of instantly decodable network coding (IDNC) in the case of lossy feedback. ...
To determine efficient partially blind policies that handle the completion and decoding delays of IDNC in such environment, we first extend the perfect feedback formulation in [2], [3] to the lossy feedback ...
Let p i and p i = 1 − p i be the data packet erasure and success probabilities, respectively, observed by receiver i on the forward link within a frame of packets. ...
arXiv:1307.3791v1
fatcat:aln7ajmbbraffddrciqfkowoxa
On the Benefits of Partial Channel State Information for Repetition Protocols in Block Fading Channels
2011
IEEE Transactions on Information Theory
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2011 pre-print arXiv:1102.4085v1 fatcat:ikip656tyrfvhopyulusf4aw6u
The novel protocol is shown to simultaneously realize the gains of HARQ and of power control with partial CSI (channel state information). ...
On the other hand, at high SNR, the repetition is useful and the performance gain comes form a combination of power control and ability of make up for deep fades. ...
The probability of successful decoding is then the probability of receiving a ACK; thus the outage capacity, or long term average successfully decoded rate, is η ACK = Pr[γ t ≥ s] log(1 + P s). ...
doi:10.1109/tit.2011.2158467
fatcat:3waozvi3tjcslpzqy5k52tjwfi
Partial Order-Based Decoding of Rate-1 Nodes in Fast Simplified Successive-Cancellation List Decoders for Polar Codes
2022
Electronics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Polar codes are the first family of error-correcting codes that can achieve channel capacity. ...
For this purpose, we use a partial order of the candidate paths to prove that only a specified number of candidates needs to be considered. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/electronics11040560
fatcat:oqb3ial3mvdp5fvqnp7suapxoy
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU
[article]
2022
IACR Cryptology ePrint Archive
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We strongly question this belief by constructing partial key exposure attacks on code-based, multivariate, and latticebased schemes (BIKE, Rainbow and NTRU). ...
In a so-called partial key exposure attack one obtains some information about the secret key, e.g. via some side-channel leakage. ...
Decoding Some of our attacks make use of information set decoding (ISD) algorithms to decode linear codes. A linear code C is a k dimensional subspace of F n q . ...
dblp:journals/iacr/EsserMVW22
fatcat:dzjzmrd7xnde5oz5fnr7ol5oja
Information-Theoretic Methods for Planning and Learning in Partially Observable Markov Decision Processes
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Bounded agents are limited by intrinsic constraints on their ability to process information that is available in their sensors and memory and choose actions and memory updates. ...
In this dissertation, we model these constraints as information-rate constraints on communication channels connecting these various internal components of the agent. ...
RF and NT are supported by the DARPA MSEE Program, the Gatsby Charitable Foundation, the Israel Science Foundation and the Intel ICRI-CI Institute. ...
arXiv:1609.07672v2
fatcat:boaf3xokwnb4dlty5cyvf5xrrm
Partial-Match Retrieval Algorithms
1976
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We examine the efficiency of hash-coding and tree-search algorithms for retrieving from a file of k-letter words all words which match a partially-specified input query word (for example, retrieving all ...
Tree-search algorithms are shown to be approximately as efficient as hash-coding algorithms, on the average. ...
I would like to thank the many people who provided constructive criticism of this research while in progress, with particular thanks to N. G. de ...
doi:10.1137/0205003
fatcat:m3z52uy4bvctxav4mosnuzo6qa
« Previous
Showing results 1 — 15 out of 21,744 results