Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Time-varying periodic convolutional codes with low-density parity-check matrix
1999475 citationsKamil Sh. Zigangirov et al.IEEE Transactions on Information Theoryprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Kamil Sh. Zigangirov
Since
Specialization
Citations
This map shows the geographic impact of Kamil Sh. Zigangirov's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kamil Sh. Zigangirov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kamil Sh. Zigangirov more than expected).
Fields of papers citing papers by Kamil Sh. Zigangirov
This network shows the impact of papers produced by Kamil Sh. Zigangirov. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kamil Sh. Zigangirov. The network helps show where Kamil Sh. Zigangirov may publish in the future.
Co-authorship network of co-authors of Kamil Sh. Zigangirov
This figure shows the co-authorship network connecting the top 25 collaborators of Kamil Sh. Zigangirov.
A scholar is included among the top collaborators of Kamil Sh. Zigangirov based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Kamil Sh. Zigangirov. Kamil Sh. Zigangirov is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kliewer, Jörg, Kamil Sh. Zigangirov, & Daniel J. Costello. (2007). New results on the minimum distance of repeat multiple accumulate codes. 1097–1102.15 indexed citations
Zigangirov, Kamil Sh., et al.. (2006). On the Design of Laminated Turbo Codes. 1–6.1 indexed citations
6.
Zhang, Wei, Michael Lentmaier, Daniel J. Costello, & Kamil Sh. Zigangirov. (2005). Braided convolutional codes. Lund University Publications (Lund University). 592–596.7 indexed citations
7.
Pusane, Alí Emre, Michael Lentmaier, Thomas E. Fuja, Kamil Sh. Zigangirov, & Daniel J. Costello. (2004). Multi-level coding/modulation using LDPC convolutional codes. Lund University Publications (Lund University).1 indexed citations
Zigangirov, Kamil Sh. & Michael Lentmaier. (2000). On the asymptotic iterative decoding performance of low-density parity-check codes. Lund University Publications (Lund University).1 indexed citations
11.
Lentmaier, Michael & Kamil Sh. Zigangirov. (2000). Mathematical analysis of an iterative algorithm for low-density code decoding. Lund University Publications (Lund University).9 indexed citations
12.
Zigangirov, Kamil Sh., et al.. (1999). The Chernoff Bounding Parameter for a Multilevel Modulation Scheme Using PSK-signaling.2 indexed citations
13.
Höst, Stefan, Rolf Johannesson, Vladimir Sidorenko, Kamil Sh. Zigangirov, & Victor Zyablov. (1998). Cascaded convolutional codes. Lund University Publications (Lund University).6 indexed citations
14.
Johannesson, Rolf & Kamil Sh. Zigangirov. (1996). On the theory of list decoding of convolutional codes. Lund University Publications (Lund University).3 indexed citations
15.
Höst, Stefan, Rolf Johannesson, Kamil Sh. Zigangirov, & Victor Zyablov. (1996). Active distances for convolutional codes. Lund University Publications (Lund University).
16.
Johannesson, Rolf, et al.. (1993). Creeper - an algorithm for sequential decoding. Lund University Publications (Lund University).3 indexed citations
17.
Johannesson, Rolf & Kamil Sh. Zigangirov. (1992). A trellis coding scheme based on signal alphabet splitting. Lund University Publications (Lund University).1 indexed citations
18.
Einarsson, G., T. Ericson, Ingemar Ingemarsson, et al.. (1989). Topics in Coding Theory. Lecture notes in control and information sciences.3 indexed citations
Cedervall, M., Rolf Johannesson, & Kamil Sh. Zigangirov. (1985). CREEPER - a new algorithm for sequential decoding. Lund University Publications (Lund University).
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.