Skip to search formSkip to main contentSkip to account menu
Noiseless coding of correlated information sources
TLDR
The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
View via Publisher
Efficient maximum likelihood decoding of linear block codes using a trellis
  • J. Wolf
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1978
It is shown that soft decision maximum likelihood decoding of any (n,k) linear block code over GF(q) can be accomplished using the Viterbi algorithm applied to a trellis with no more than q^{(n-k)}…
View via Publisher
Characterizing flash memory: Anomalies, observations, and applications
TLDR
This work empirically characterized flash memory technology from five manufacturers by directly measuring the performance, power, and reliability, and demonstrates that performance varies significantly between vendors, devices, and from publicly available datasheets.
View on ACM
Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels
TLDR
The structure of LDPC convolutional code ensembles is suitable to obtain performance close to the theoretical limits over the memoryless erasure channel, both for the BP decoder and windowed decoding but the same structure imposes limitations on the performance over erasure channels with memory.
View on IEEE
Transmission of noisy information to a noisy receiver with minimum distortion
  • J. Wolf, J. Ziv
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1 July 1970
TLDR
The criterion for optimality is that the normalized average of the squared norm of the difference between the T - second undistorted source sample and the corresponding T -second sample delivered to the final destination be minimum.
View via Publisher
A pragmatic approach to trellis-coded modulation
TLDR
This pragmatic approach to all coding applications permits the use of a single basic coder and decoder to achieve respectable coding (power) gains for bandwidth efficiencies from 1 b/s/Hz to 6 b/S/Hz.
View on IEEE
The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.)
TLDR
The capacity of a single-input single-output discrete memoryless channel is not increased by the use of a noiseless feedback link, but the capacity region for such a channel is enlarged if a noisy feedback link is utilized.
View via Publisher
Codes for Digital Recorders
TLDR
This paper surveys the theory and practice of constrained coding, tracing the evolution of the subject from its origins in Shannon's classic 1948 paper to present-day applications in high-density digital recorders.
View via Publisher
Turbo decoding for PR4: parallel versus serial concatenation
TLDR
A simplified serial concatenation system is presented that uses as its outer code a single convolutional code and as its inner code the partial response channel, and an extension is also presented that combines a second code with the channel, forming a more powerful inner code.
View on IEEE
On the performance evaluation of trellis codes
TLDR
It is shown that for an interesting class of trellis codes a modified generating function can be defined for which the number of states {\em is equal to} the number-error probabilities of thetrellis states.
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License