Kamil Zigangirov

författare

• 2012
  • Analysis and Design of Tuned Turbo Codes
• 2010
  • Braided Convolutional Codes: A New Class of Turbo-Like Codes
  • Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes
  • Iterative decoding threshold analysis for LDPC convolutional codes
• 2009
  • Approaching Capacity with Asymptotically Regular LDPC Codes
  • Braided Block Codes
  • Multi-User OFDM Based on Braided Convolutional Codes
• 2008
  • Asymptotic Distance and Convergence Analysis of Braided Protograph Convolutional Codes
  • Convolutional Codes for Iterative Decoding
  • Implementation Aspects of LDPC Convolutional Codes
  • LDPC Convolutional Codes Based on Braided Convolutional Codes
  • New Multi-User OFDM Scheme: Braided Code Division Multiple Access
• 2007
  • Distance bounds for an ensemble of LDPC convolutional codes
• 2006
  • Encoders and decoders for braided block codes
  • Joint permutor analysis and design for multiple turbo codes
• 2005
  • An analysis of the block error probability performance of iterative decoding
  • Braided convolutional codes
  • Laminated turbo codes
  • On coded modulation using LDPC convolutional codes
  • On the minimum distance of codes with parity-check matrices constructed from permutation matrices
  • Terminated LDPC convolutional codes with thresholds close to capacity
• 2004
  • Analytic expressions for the bit error probabilities of rate-1/2 memory 2 convolutional encoders
  • Convergence analysis for a class of LDPC convolutional codes on the erasure channel
  • Multi-level coding/modulation using LDPC convolutional codes
  • On permutor designs based on cycles for serially concatenated convolutional codes
  • On the Free Distance of LDPC Convolutional Codes
  • On the block error probability of iteratively decoded LDPC codes
  • Reduced complexity decoding strategies for LDPC convolutional codes
  • Theory of code division multiple access communication
  • Turbo codes and Shannon's condition for reliable communication
• 2003
  • Asymptotic analysis of superorthogonal turbo codes
  • On bandwidth-efficient convolutional LDPC codes
  • On braided block codes
  • On cycle-based permutor designs for serially concatenated codes
• 2002
  • Analytic expression for the exact bit error probability of the (7,5) convolutional code
  • Iteratively decodable sliding codes on graphs
  • On the asymptotic analysis of superorthogonal turbo codes
  • On the minimum distance of turbo codes
  • Two approaches to the analysis of low-density parity-check codes
• 2001
  • Analysis of the asymptotic iterative decoding performance of turbo codes
  • Improved bound on the error probability of fixed convolutional codes
  • Mathematical analysis of iterative decoding of LDPC convolutional codes
  • Some results concerning design and decoding of turbo-codes
  • To the theory of low-density convolutional codes II
• 2000
  • Analytical approach to low-density convolutional codes
  • Mathematical analysis of an iterative algorithm for low-density code decoding
  • On the asymptotic iterative decoding performance of low-density parity-check codes
• 1999
  • Active distances for convolutional codes
  • Fundamentals of convolutional coding
  • On generalized low-density parity-check codes based on Hamming component codes
  • On the theory of low-density convolutional codes
• 1998
  • A simple one sweep algorithm for optimal APP symbol decoding of linear block codes
  • Cascaded convolutional codes
  • Cascaded convolutional codes
  • Iterative decoding of generalized low-density parity-check codes
• 1997
  • Active distances and cascaded convolutional codes
  • On the distribution of the output error burst lengths for Viterbi decoding of convolutional codes
• 1996
  • Active distances for convolutional codes
  • An expurgation upper bound on the probability of corret path loss for time-invariant convolutional codes
  • On the theory of list decoding of convolutional codes
• 1995
  • Bounds on the number of computations of sequential decoding for the Gilbert-Elliott channel
  • Decoding procedure capacities for the Gilbert-Elliott channel
  • Lower bounds on the free distance for random concatenated convolutional codes
  • Upper bounds on the probability of the correct path loss for list decoding of fixed convolutional codes
• 1994
  • New results on estimations of the burst and bit error probabilities for fixed convolutional codes
• 1993
  • Creeper - an algorithm for sequential decoding
  • Efficient splitting of multidimensional alphabets for modulation codes
  • Estimating some important parameters for the Gilbert-Elliott channel using a sequential decoder
  • Strengthening Viterbi's upper bound on the bit error probability for maximum likelihood decoding of fixed binary convolutional codes
• 1992
  • A trellis coding scheme based on signal alphabet splitting
• 1991
  • Estimating the computational cut-off rate for the Gilbert-Elliott channel
  • Estimating the computational cut-off rate for the Gilbert-Elliott channel
• 1990
  • Sequential decoding and Wald's identity
• 1989
  • A lower bound on the distance profile for convolutional codes
  • Distances and distance bounds for convolutional codes - an overview
• 1988
  • On sequential decoding for the Gilbert channel
  • On sequential decoding for the Gilbert-Elliott channel
• 1987
  • On sequential decoding for the Gilbert-Elliott channel
• 1986
  • On sequential decoding for the Gilbert channel
• 1985
  • A new sequential decoding algorithm for fading channels
  • CREEPER - a new algorithm for sequential decoding
  • On the distribution of the number of computations in any finite number of subtrees for the stack algorithm
• 1984
  • A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes
  • CREEPER - an easily implementable algorithm for sequential decoding
• 1983
  • On the distribution of the number of computations in any finite number of subtrees for the stack algorithm
• 1982
  • A new upper bound on the first-event error probability for maximum-likelihood decoding of specific binary convolutional codes
• 1981
  • On an upper bound on the error probability of specific convolutional codes with maximum-likelihood decoding
• 1979
  • On the distribution of average number of computations for the stack algorithm