A simple derivation of the coding theorem and some applications.
Upper bounds on probability of error achieved by using block codes on general time-discrete memoryless channel
CODING SYSTEM↗
SEARCH · Engineering Papers
Results for “Coding”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Comma-free error-correcting codes.
Comma-free properties of any group code from simple observation of null space
CODING SYSTEM↗
Coding concepts for error control.
Relative merits of various coding methods used to increase reliability or data rate on data transmission channel
DATA TRANSMISSION↗
On decoding BCH codes.
Extension, modification and analysis of Gorenstein-Zierler decoding algorithm for binary codes of Bose, Ray-Chaudhuri and Hocquenghem /BCH/ correcting erasures and errors
BINARY CODE↗
Simultaneous error-correction and burst-error detection using binary linear cyclic codes.
Simultaneous error correction and burst error detection, using binary linear cyclic codes
ERROR DETECTING CODE↗
Lower bounds to error probability for coding on discrete memoryless channels. I.
Lower bounds to minimum error probability using block coding on noisy discrete memoryless communication channels
ERROR DETECTING CODE↗
Prefix coding of histograms for minimal storage.
Prefix coding of histograms for minimal storage
HISTOGRAM↗
Performance measures for compressed and coded space telemetry systems.
Data compression and error control coding in space telemetry analyzed, using performance measures similar to distortion function
ERROR DETECTING CODE↗
Lower bounds to error probability for coding on discrete memoryless channels. II.
Lower bounds to minimum error probability for block coding on noisy discrete memoryless channels
CHANNEL CAPACITY↗
Performance of a high-speed concatenated coded modulation scheme over fading channels
In this paper we simulate the performance of these codes over additive white Gaussian noise and Rayleigh fading channels.
concatenated coded modulation hamming accumulator ↗
Constrained coding for the deep-spaced optical channel
In this paper, we demonstrate a class of low-complexity modulation codes satisfying the (d,k) constraint that offer throughput gains over M-PPM on the order of 10-15%, which translate into SNR gains of .4 - .6 dB.
constrained coding optical communications error-co↗
Performance complexity tradeoffs for turbo and turbo-like codes
We take a first empirical step toward understanding the performance-complexity tradeoffs that have newly arisen since the advent of turbo codes.
turbo codes coding complexity↗
Low Complexity Turbo-like Codes
This paper addresses the iterative devoding analysis, design, and performance of low complexity turbo like codes.
turbo-like codes iterative decoding analysis conca↗
Continuous MAP Algorithms and Their Applications to Decode Parallel and Serial Code Concatenations
Concatenated coding schemes with interleavers consist of the combination of two simple constituent encoders and an interleaver. The parallel concatenation known as.
algorithms decoding parallel code concatenations s↗
Prioritized LT Codes
It is common in data transmissions that some information is more important than others. This is especially true in space communications where mission critical information or science data are high priority. In this work, we propose a simple yet constructive scheme to send high priority data reliably and efficiently using Luby Transform (LT) codes. The new proposed scheme modifies the conventional LT encoder to send high priority data as a degree 1 and 2 so that high priority data can be quickly resolved and very likely recovered before a decoder stops. Preliminary results show that a carefully designed degree distribution of high priority data increases the likelihood of receiving high priority information while having negligible performance impact on data with lower priority. The performance of the proposed scheme is evaluated and compared with the conventional LT approach with the same parameters under a range of erasure error rates.
priority coding↗
Prioritized Luby Transform (LT) Codes
This viewgraph presentation describes a prioritized Luby Transform coding scheme that seeks to decode high priority data with high reliability, when decoders fail.
Luby Transform (LT) codes↗
FORMULATION AND DIGITAL CODING OF APPROXIMATE HYDROGEN PROPERTIES FOR APPLICATION TO FLOW COMPUTATIONS
Formulation and digital coding of approximate hydrogen properties for application to flow computations
FLUID↗