The following pages link to Aleksandar Kavčić (Q2983350):
Displaying 18 items.
- Achievable Rates of MIMO Systems With Linear Precoding and Iterative LMMSE Detection (Q2983351) (← links)
- Reliability Distributions of Truncated Max-Log-MAP (MLM) Detectors Applied to Binary ISI Channels (Q2989327) (← links)
- Upper Bounds on the Capacities of Noncontrollable Finite-State Channels With/Without Feedback (Q2989830) (← links)
- Binary intersymbol interference channels: gallager codes, density evolution, and code performance bounds (Q3547114) (← links)
- Matched Information Rate Codes for Partial Response Channels (Q3547116) (← links)
- Error exponents for finite-hypothesis channel identification (Q3547379) (← links)
- Feedback Capacity of Finite-State Machine Channels (Q3547844) (← links)
- Equal-diagonal QR decomposition and its application to precoder design for successive-cancellation detection (Q3547881) (← links)
- On the Feedback Capacity of Power-Constrained Gaussian Noise Channels With Memory (Q3548288) (← links)
- A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels (Q3604502) (← links)
- Matrices with banded inverses: inversion algorithms and factorization of Gauss-Markov processes (Q4501738) (← links)
- The Viterbi algorithm and Markov noise memory (Q4545750) (← links)
- Capacity of Multilevel NAND Flash Memory Channels (Q4589416) (← links)
- Path partitions and forward-only trellis algorithms (Q4679878) (← links)
- Code Automorphisms and Permutation Decoding of Certain Reed–Solomon Binary Images (Q5281274) (← links)
- Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part I: An Algebraic Soft-In Hard-Out Chase Decoder (Q5281556) (← links)
- Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding (Q5281558) (← links)
- Subspace tracking with adaptive threshold rank estimation (Q5687851) (← links)