The following pages link to Boris D. Kudryashov (Q1705503):
Displaying 45 items.
- (Q376108) (redirect page) (← links)
- Dual convolutional codes and the MacWilliams identities (Q376109) (← links)
- Random coding bound for the second moment of multidimensional lattices (Q415709) (← links)
- Decoding of block codes obtained from convolution codes (Q751626) (← links)
- Viterbi algorithm for decoding of convolutional codes in a system with decision feedback (Q761416) (← links)
- Woven convolutional graph codes with large free distances (Q764245) (← links)
- List decoding of convolutional codes (Q920928) (← links)
- Block codes from convolution codes (Q923060) (← links)
- Convolutional-block coding in channels with decision feedback (Q1065753) (← links)
- Some Markov chain functions and associated non-symmetric random walks with absorbing barriers (Q1117588) (← links)
- Message transmission over a discrete channel with noiseless feedback (Q1140583) (← links)
- Upper bounds for decoding error probability in some broadcast channels (Q1140603) (← links)
- List decoding in a Gaussian channel (Q1179607) (← links)
- Distance properties of short LDPC codes and their impact on the BP, ML and near-ML decoding performance (Q1705505) (← links)
- Graph-based convolutional and block LDPC codes (Q2269366) (← links)
- Universal coding for memoryless sources with countably infinite alphabets (Q2352641) (← links)
- Multi-Class Source-Channel Coding (Q2976637) (← links)
- Searching for Binary and Nonbinary Block and Convolutional LDPC Codes (Q2977044) (← links)
- A BEAST for Prowling in Trees (Q3546580) (← links)
- BEAST Decoding of Block Codes Obtained Via Convolutional Codes (Q3546581) (← links)
- Low State Complexity Block Codes Via Convolutional Codes (Q3546582) (← links)
- Trellis Complexity of Short Linear Codes (Q3548252) (← links)
- An Improved Bound on the List Error Probability and List Distance Properties (Q3604427) (← links)
- Soft-Output BEAST Decoding With Application to Product Codes (Q3604527) (← links)
- (Q3803936) (← links)
- (Q3858158) (← links)
- (Q4274873) (← links)
- Error probability for repeat request systems with convolutional codes (Q4307385) (← links)
- Rational rate punctured convolutional codes for soft-decision Viterbi decoding (Q4345636) (← links)
- (Q4352792) (← links)
- (Q4500978) (← links)
- Tailbiting codes: bounds and search results (Q4544769) (← links)
- BP-LED Decoding Algorithm for LDPC Codes Over AWGN Channels (Q4629926) (← links)
- Fast infinite response filtering for speech processing (Q4637813) (← links)
- On trellis codes for linear predictive speech compression (Q4637815) (← links)
- Tailbiting codes obtained via convolutional codes with large active distance-slopes (Q4677578) (← links)
- Distance spectra and upper bounds on error probability for trellis codes (Q4838695) (← links)
- (Q4886139) (← links)
- (Q4954411) (← links)
- Woven Graph Codes: Asymptotic Performances and Examples (Q4976035) (← links)
- Stopping Redundancy Hierarchy Beyond the Minimum Distance (Q5224028) (← links)
- A Closed-Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes (Q5271826) (← links)
- Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth (Q5272010) (← links)
- A Rate $R=5/20$ Hypergraph-Based Woven Convolutional Code With Free Distance $120$ (Q5281522) (← links)
- Nonbinary LDPC coded QAM signals with optimized mapping: bounds and simulation results (Q6574781) (← links)
