default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKamil Sh. Zigangirov
- > Home > Persons > Kamil Sh. Zigangirov
Publications
- 2012
[j39]Christian Koller, Alexandre Graell i Amat
, Jörg Kliewer, Francesca Vatta, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Analysis and Design of Tuned Turbo Codes. IEEE Trans. Inf. Theory 58(7): 4796-4813 (2012)- 2011
- [c23]Dmitri K. Zigangirov, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Partially-regular LDPC codes with linear encoding complexity and improved thresholds. ISIT 2011: 528-532 - 2010
- [j38]Wei Zhang, Michael Lentmaier, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Braided convolutional codes: a new class of turbo-like codes. IEEE Trans. Inf. Theory 56(1): 316-331 (2010) - [j37]Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes. IEEE Trans. Inf. Theory 56(9): 4301-4308 (2010) - [j36]Michael Lentmaier, Arvind Sridharan, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
Iterative decoding threshold analysis for LDPC convolutional codes. IEEE Trans. Inf. Theory 56(10): 5274-5289 (2010) - [i4]Christian Koller, Alexandre Graell i Amat, Jörg Kliewer, Francesca Vatta, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Analysis and Design of Tuned Turbo Codes. CoRR abs/1010.5278 (2010) - 2009
- [j35]Alberto Jiménez Feltström, Dmitri V. Truhachev, Michael Lentmaier, Kamil Sh. Zigangirov:
Braided block codes. IEEE Trans. Inf. Theory 55(6): 2640-2658 (2009) - [c22]Michael Lentmaier, Marcos B. S. Tavares, Gerhard P. Fettweis, Kamil Sh. Zigangirov:
Multi-user OFDM Based on Braided Convolutional Codes. MCSS 2009: 25-34 - 2008
- [j34]Kamil Sh. Zigangirov, Ali Emre Pusane, Dmitri K. Zigangirov, Daniel J. Costello Jr.:
On the error-correcting capability of LDPC codes. Probl. Inf. Transm. 44(3): 214-225 (2008) - [j33]Stephen Bates, Zhengang Chen, Logan Gunthorpe, Ali Emre Pusane, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
A Low-Cost Serial Decoder Architecture for Low-Density Parity-Check Convolutional Codes. IEEE Trans. Circuits Syst. I Regul. Pap. 55-I(7): 1967-1976 (2008) - [j32]Ali Emre Pusane, Alberto Jiménez Feltström, Arvind Sridharan, Michael Lentmaier, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Implementation aspects of LDPC convolutional codes. IEEE Trans. Commun. 56(7): 1060-1069 (2008) - [j31]Axel Huebner, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Laminated Turbo Codes: A New Class of Block-Convolutional Codes. IEEE Trans. Inf. Theory 54(7): 3024-3034 (2008) - [c21]Marcos B. S. Tavares, Michael Lentmaier, Kamil Sh. Zigangirov, Gerhard P. Fettweis:
New multi-user OFDM scheme: Braided code division multiple access. ACSCC 2008: 963-967 - [c20]Marcos B. S. Tavares, Michael Lentmaier, Gerhard P. Fettweis, Kamil Sh. Zigangirov:
Asymptotic distance and convergence analysis of braided protograph convolutional codes. Allerton 2008: 1073-1080 - [c19]Jörg Kliewer, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
On the minimum trapping distance of repeat accumulate accumulate codes. Allerton 2008: 1410-1415 - [c18]David G. M. Mitchell, Ali Emre Pusane, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Asymptotically good LDPC convolutional codes based on protographs. ISIT 2008: 1030-1034 - [c17]Marcos B. S. Tavares, Michael Lentmaier, Kamil Sh. Zigangirov, Gerhard P. Fettweis:
LDPC convolutional codes based on braided convolutional codes. ISIT 2008: 1035-1039 - [c16]Christian Koller, Jörg Kliewer, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Minimum distance bounds for multiple-serially concatenated code ensembles. ISIT 2008: 1888-1892 - [i3]David G. M. Mitchell, Ali Emre Pusane, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Asymptotically Good LDPC Convolutional Codes Based on Protographs. CoRR abs/0805.0241 (2008) - [i2]Jörg Kliewer, Kamil Sh. Zigangirov, Christian Koller, Daniel J. Costello Jr.:
Coding Theorems for Repeat Multiple Accumulate Codes. CoRR abs/0810.3422 (2008) - 2007
- [j30]Arvind Sridharan, Dmitri V. Truhachev, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
Distance Bounds for an Ensemble of LDPC Convolutional Codes. IEEE Trans. Inf. Theory 53(12): 4537-4555 (2007) - [c15]Marcos B. S. Tavares, Kamil Sh. Zigangirov, Gerhard P. Fettweis:
Tail-Biting LDPC Convolutional Codes. ISIT 2007: 2341-2345 - [c14]Marcos B. S. Tavares, Kamil Sh. Zigangirov, Gerhard P. Fettweis:
Tail-Biting LDPC Convolutional Codes Based on Protographs. VTC Fall 2007: 1047-1051 - 2006
- [j29]Dmitri K. Zigangirov, Kamil Sh. Zigangirov:
Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel. Probl. Inf. Transm. 42(2): 106-113 (2006) - [j28]Axel Huebner, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
A new cycle-based joint permutor design for multiple turbo codes. IEEE Trans. Commun. 54(6): 961-965 (2006) - [j27]C. He, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
Joint Permutor Analysis and Design for Multiple Turbo Codes. IEEE Trans. Inf. Theory 52(9): 4068-4083 (2006) - [c13]Ali Emre Pusane, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Construction of Irregular LDPC Convolutional Codes with Fast Encoding. ICC 2006: 1160-1165 - [c12]Stephen Bates, Logan Gunthorpe, Ali Emre Pusane, Zhengang Chen, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Decoders for low-density parity-check convolutional codes with large memory. ISCAS 2006 - [c11]Dmitri K. Zigangirov, Kamil Sh. Zigangirov:
On the Erasure Correction Capability of LDPC Codes. ISIT 2006: 416-420 - [c10]Gerd Richter, Markus Kaupper, Kamil Sh. Zigangirov:
Irregular Low-Density Parity-Check Convolutional Codes Based on Protographs. ISIT 2006: 1633-1637 - [c9]Axel Hübner, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
On the Free Distance of Convolutional Turbo Codes. ISIT 2006: 1638-1642 - [c8]Kamil Sh. Zigangirov, Alberto Jiménez Feltström, Michael Lentmaier, Dmitri V. Truhachev:
Encoders and Decoders for Braided Block Codes. ISIT 2006: 1808-1812 - 2005
- [j26]Arvind Sridharan, Michael Lentmaier, Dmitri V. Truhachev, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices. Probl. Inf. Transm. 41(1): 33-44 (2005) - [j25]Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
An analysis of the block error probability performance of iterative decoding. IEEE Trans. Inf. Theory 51(11): 3834-3855 (2005) - [c7]Wei Zhang, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
Braided convolutional codes. ISIT 2005: 592-596 - [c6]Axel Huebner, Michael Lentmaier, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Laminated turbo codes. ISIT 2005: 597-601 - [c5]Michael Lentmaier, Arvind Sridharan, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Terminated LDPC convolutional codes with thresholds close to capacity. ISIT 2005: 1372-1376 - [i1]Michael Lentmaier, Arvind Sridharan, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Terminated LDPC Convolutional Codes with Thresholds Close to Capacity. CoRR abs/cs/0508030 (2005) - 2004
- [j24]Axel Huebner, Dmitri V. Truhachev, Kamil Sh. Zigangirov:
On permutor designs based on cycles for serially concatenated convolutional codes. IEEE Trans. Commun. 52(9): 1494-1503 (2004) - [j23]Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov:
Analytic Expressions for the Bit Error Probabilities of Rate-1/2 Memory 2 Convolutional Encoders. IEEE Trans. Inf. Theory 50(6): 1303-1311 (2004) - [c4]Arvind Sridharan, Dmitri V. Truhachev, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
On the free distance of LDPC convolutional codes. ISIT 2004: 311 - [c3]Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Turbo codes and Shannon's condition for reliable communication. ISIT 2004: 442 - [c2]Ali Emre Pusane, Michael Lentmaier, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Reduced complexity decoding strategies for LDPC convolutional codes. ISIT 2004: 490 - 2003
- [j22]Ola Wintzell, Michael Lentmaier, Kamil Sh. Zigangirov:
Asymptotic analysis of superorthogonal turbo codes. IEEE Trans. Inf. Theory 49(1): 253-258 (2003) - 2001
- [j21]Dmitri V. Truhachev, Karin Engdahl, Kamil Sh. Zigangirov:
New Decoding Error Probability Bounds for Fixed Convolutional Codes used in BSC. Electron. Notes Discret. Math. 6: 123-131 (2001) - [j20]Dmitri V. Truhachev, Michael Lentmaier, Kamil Sh. Zigangirov:
Some Results Concerning the Design and Decoding of Turbo-Codes. Probl. Inf. Transm. 37(3): 190-205 (2001) - [j19]Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov:
To the Theory of Low-Density Convolutional Codes. II. Probl. Inf. Transm. 37(4): 288-306 (2001) - [j18]Karin Engdahl, Kamil Sh. Zigangirov:
Tighter bounds on the error probability of fixed convolutional codes. IEEE Trans. Inf. Theory 47(4): 1625-1630 (2001) - [j17]Ola Wintzell, Dmitri K. Zigangirov, Kamil Sh. Zigangirov:
On the capacity of a pulse-position-hopped CDMA system. IEEE Trans. Inf. Theory 47(6): 2639-2644 (2001) - [j16]Gerd Beyer, Karin Engdahl, Kamil Sh. Zigangirov:
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part I. IEEE Trans. Inf. Theory 47(7): 2782-2792 (2001) - [j15]Gerd Beyer, Karin Engdahl, Kamil Sh. Zigangirov:
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part II. IEEE Trans. Inf. Theory 47(7): 2793-2806 (2001) - 1999
- [j14]Michael Lentmaier, Kamil Sh. Zigangirov:
On generalized low-density parity-check codes based on Hamming component codes. IEEE Commun. Lett. 3(8): 248-250 (1999) - [j13]Stefan Höst, Rolf Johannesson, Kamil Sh. Zigangirov, Victor V. Zyablov:
Active Distances for Convolutional Codes. IEEE Trans. Inf. Theory 45(2): 658-669 (1999) - [j12]Alberto Jiménez Feltström, Kamil Sh. Zigangirov:
Time-varying periodic convolutional codes with low-density parity-check matrix. IEEE Trans. Inf. Theory 45(6): 2181-2191 (1999) - [j11]Alberto Jiménez Feltström, Kamil Sh. Zigangirov:
On coherent reception of uplink transmitted signals in the DS-CDMA system. IEEE Trans. Inf. Theory 45(7): 2655-2661 (1999) - [c1]Karin Engdahl, Michael Lentmaier, Kamil Sh. Zigangirov:
On the Theory of Low-Density Convolutional Codes. AAECC 1999: 77-86 - 1998
- [j10]Leif Wilhelmsson, Kamil Sh. Zigangirov:
Analysis of MFSK frequency-hopped spread-spectrum multiple-access over a Rayleigh fading channel. IEEE Trans. Commun. 46(10): 1271-1274 (1998) - [j9]Karin Engdahl, Kamil Sh. Zigangirov:
On the Calculation of the Error Probability for a Multilevel Modulation Scheme Using QAM-Signaling. IEEE Trans. Inf. Theory 44(4): 1612-1620 (1998) - [j8]Thomas Johansson, Kamil Sh. Zigangirov:
A Simple One-Sweep Algorithm for Optimal APP Symbol Decoding of Linear Block Codes. IEEE Trans. Inf. Theory 44(7): 3124-3129 (1998) - 1997
- [j7]Leif Wilhelmsson, Kamil Sh. Zigangirov:
On uncoordinated transmission over the T-user q-ary noiseless multiple-access channel. IEEE Trans. Inf. Theory 43(2): 707-711 (1997) - 1993
- [j6]Kamil Sh. Zigangirov, Harro Osthoff:
Analysis of Global-List Decoding for Convolutional Codes. Eur. Trans. Telecommun. 4(2): 165-173 (1993) - 1992
- [j5]Vladimir V. Chepyzhov, Ben J. M. Smeets, Kamil Sh. Zigangirov:
The free distance of fixed convolutional rate 2/4 codes meets the Costello bound. IEEE Trans. Inf. Theory 38(4): 1360-1366 (1992) - 1988
- [j4]Vladimir Sidorenko, Rolf Johannesson, Kamil Sh. Zigangirov:
On sequential decoding for the Gilbert channel. IEEE Trans. Inf. Theory 34(5): 1058-1061 (1988) - 1985
- [j3]Rolf Johannesson, Kamil Sh. Zigangirov:
On the distribution of the number of computations in any finite number of subtrees for the stack algorithm. IEEE Trans. Inf. Theory 31(1): 100-102 (1985) - 1984
- [j2]Mats L. Cedervall, Rolf Johannesson, Kamil Sh. Zigangirov:
A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes. IEEE Trans. Inf. Theory 30(5): 762-766 (1984)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
