K. Sh. Zigangirov

From MaRDI portal
Revision as of 13:45, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page K. Sh. Zigangirov to K. Sh. Zigangirov: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:174183

Available identifiers

zbMath Open zigangirov.kamil-shMaRDI QIDQ174183

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q50901982022-07-18Paper
Braided Block Codes2017-08-08Paper
Braided Convolutional Codes: A New Class of Turbo-Like Codes2017-07-27Paper
Iterative Decoding Threshold Analysis for LDPC Convolutional Codes2017-07-27Paper
Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes2017-07-27Paper
Analysis and Design of Tuned Turbo Codes2017-07-12Paper
Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel2012-05-09Paper
On the error-correcting capability of LDPC codes2009-10-20Paper
Laminated turbo codes: A new class of block-convolutional codes2009-02-24Paper
Analytic Expressions for the Bit Error Probabilities of Rate-<tex>$1/2$</tex>Memory<tex>$2$</tex>Convolutional Encoders2008-12-21Paper
An analysis of the block error probability performance of iterative decoding2008-12-21Paper
Distance Bounds for an Ensemble of LDPC Convolutional Codes2008-12-21Paper
On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices2005-12-19Paper
Asymptotic analysis of superorthogonal turbo codes2005-05-31Paper
Some results concerning the design and decoding of turbo-codes2003-10-12Paper
On the theory of low-density convolutional codes. II2003-09-08Paper
Tighter bounds on the error probability of fixed convolutional codes2002-08-04Paper
On the capacity of a pulse-position-hopped CDMA system2002-08-04Paper
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling .I2002-08-04Paper
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling .II2002-08-04Paper
To the theory of low-density convolutional codes. I2002-03-06Paper
A posteriori probability decoding of convolutional codes2001-11-19Paper
https://portal.mardi4nfdi.de/entity/Q27414012001-10-14Paper
Analysis of MFSK frequency-hopped spread-spectrum multiple-access over a Rayleigh fading channel2001-08-14Paper
Mathematical analysis of an iterative decoding algorithm for low-density codes2001-04-26Paper
https://portal.mardi4nfdi.de/entity/Q45026132000-09-12Paper
Time-varying periodic convolutional codes with low-density parity-check matrix2000-09-07Paper
On coherent reception of uplink transmitted signals in the DS-CDMA system2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q45009942000-09-03Paper
On the calculation of the error probability for a multilevel modulation scheme using QAM-signaling1999-11-21Paper
A simple one-sweep algorithm for optimal APP symbol decoding of linear block codes1999-11-21Paper
Active distances for convolutional codes1999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42563621999-07-11Paper
Comparative analysis of the hexagonal multilevel QAM and rectangular multilevel QAM1999-06-03Paper
Nonbinary convolutional coding in channels with jamming1998-08-19Paper
On the asymptotic capacity of a multi-access channel1998-07-15Paper
On the theory of list decoding of convolutional codes1998-07-08Paper
On uncoordinated transmission over the T-user q-ary noiseless multiple-access channel1997-06-10Paper
https://portal.mardi4nfdi.de/entity/Q48572631995-11-26Paper
A trellis coding scheme based on signal alphabet splitting1994-03-08Paper
Topics in coding theory. In honour of Lars H. Zetterberg1993-06-05Paper
Mathematical analysis of algebraic sequential coding1993-03-18Paper
The free distance of fixed convolutional rate 2/4 codes meets the Costello bound1992-10-11Paper
Sequential syndrome decoding of convolutional codes over large alphabets1992-06-26Paper
Existence of time-invariant convolutional codes with transmission rate \(2/c\) for \(c \geq{}4\) attaining the Costello bound1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q57525221991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57492381989-01-01Paper
New asymptotic lower bounds on the free distance for time-constant convolutional codes1986-01-01Paper
New upper bounds for decoding error probability for convolutional codes1985-01-01Paper
On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.)1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37278601985-01-01Paper
Centered codes1984-01-01Paper
A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes (Corresp.)1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39157921981-01-01Paper
Sequential decoding for channels with synchronization errors1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38889721980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38723601979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41774661978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38581321977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41286741977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41487141977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41386351976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41017011975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41608371975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40932881974-01-01Paper
On the error probability of sequential decoding on the BSC1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56773841971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56845441970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40489551969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40489541967-01-01Paper
On a Problem in Optimal Scanning1966-01-01Paper

Research outcomes over time

This page was built for person: K. Sh. Zigangirov