Pages that link to "Item:Q5510063"
From MaRDI portal
The following pages link to A simple derivation of the coding theorem and some applications (Q5510063):
Displaying 45 items.
- On the BSC reliability function: expanding the region where it is known exactly (Q327296) (← links)
- On the reliability function for a BSC with noisy feedback (Q415711) (← links)
- An upper bound on error probability in communication systems with single-user reception based on order statistics (Q827893) (← links)
- Multidimensional state estimation using stacks for dynamic systems with interference (Q909629) (← links)
- State estimation for nonlinear discrete dynamic systems with missing observations (Q910374) (← links)
- Finite state machines in state estimation for dynamic systems with and \(n\)th order memory and nonlinear interference (Q916624) (← links)
- State estimation via limited capacity noisy communication channels (Q926289) (← links)
- On some upper bounds for the probability of error (Q1079538) (← links)
- The role of duality in optimization problems involving entropy functionals with applications to information theory (Q1094664) (← links)
- A coding theorem for multiple access channels using a maximum likelihood list decoding scheme (Q1141117) (← links)
- Coding theorem for partial received information (Q1148289) (← links)
- Exponential error bounds for an erasure scheme for partial received information (Q1152342) (← links)
- A simpler proof of Jensen's coding theorem (Q1338196) (← links)
- A note on random coding bounds for classical-quantum channels (Q1752307) (← links)
- An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection (Q1812392) (← links)
- Properties of noncommutative Rényi and Augustin information (Q2113490) (← links)
- The Augustin capacity and center (Q2190923) (← links)
- The sphere packing bound for memoryless channels (Q2211175) (← links)
- Second-order asymptotics for the classical capacity of image-additive quantum channels (Q2354350) (← links)
- Sharpening of an upper bound for the reliability function of a binary symmetric channel (Q2432956) (← links)
- On the complexity of suboptimal decoding for list and decision feedback schemes (Q2489924) (← links)
- Coding Theory: A General Framework and Two Inverse Problems (Q3187047) (← links)
- STATE ESTIMATION FOR GENERAL DYNAMIC SYSTEMS WITH NONLINEAR INTERFERENCE AND MISSING OBSERVATIONS∗ (Q3202929) (← links)
- Optimum decoding-based smoothing algorithm for dynamic systems (Q3695159) (← links)
- Optimum decoding based smoothing algorithm for dynamic systems with interference (Q3708675) (← links)
- A stack sequential decoding based smoothing algorithm for dynamic systems (Q3712216) (← links)
- A stack sequential decoding-based smoothing algorithm for dynamic systems with interference (Q3718605) (← links)
- A suboptimum decoding-based smoothing algorithm for dynamic systems with or without interference (Q3728789) (← links)
- ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC (Q3728800) (← links)
- Multidimensional state estimation with blocks and Viterbi decoding algorithms (Q3780974) (← links)
- Fast state estimation scheme for multidimensional dynamic systems (Q3807990) (← links)
- Non-linear smoothing algorithm for multi-dimensional dynamic systems (Q3827920) (← links)
- STATE ESTIMATION WITH STACKS AND INTERPOLATING FUNCTIONS FOR DYNAMIC SYSTEMS WITH MISSING OBSERVATIONS AND NONLINEAR INTERFERENCE* (Q3978353) (← links)
- (Q4103014) (← links)
- On Future-Dependent Block Coding for Input-Restricted Channels (Q4177467) (← links)
- Multi-dimensional state smoothing in the presence of non-linear interference (Q4733796) (← links)
- (Q4735137) (← links)
- A simple derivation of the refined sphere packing bound under certain symmetry hypotheses (Q4970859) (← links)
- Non-linear state smoothing for discrete dynamic systems with past histories (Q5202614) (← links)
- An application of rate-distortion theory to a converse to the coding theorem (Q5554040) (← links)
- Error estimates for low rate codes (Q5604959) (← links)
- The strong converse theorem in the decoding scheme of list size $L$ (Q5612991) (← links)
- Lower bounds to error probability for coding on discrete memoryless channels. I (Q5657992) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- Variations on the Gallager bounds with some applications (Q5951416) (← links)