Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Karunakar Pedagani

dblp:62/2912 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 62% Computational geometry · 38%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry › discrete geometry
integer lattice
0.012004
High-rate girth-eight low-density parity-check codes on rectangular integer lattices · IEEE Trans. Commun. 2004
Coding theory › error-correcting codes
LDPC codes
0.012004
High-rate girth-eight low-density parity-check codes on rectangular integer lattices · IEEE Trans. Commun. 2004
Coding theory
circulant matrix
0.012004
High-rate girth-eight low-density parity-check codes on rectangular integer lattices · IEEE Trans. Commun. 2004
Coding theory › error-correcting codes › block codes › linear code
parity-check matrix
0.012004
High-rate girth-eight low-density parity-check codes on rectangular integer lattices · IEEE Trans. Commun. 2004

Methods — techniques the papers use, named apart from their topics

point-line incidence · 0.0combinatorial construction · 0.0
YearPublicationVenuePosition
2004 High-rate girth-eight low-density parity-check codes on rectangular integer lattices
abstract
This letter introduces a combinatorial construction of girth-eight high-rate low-density parity-check codes based on integer lattices. The parity-check matrix of a code is defined as a point-line incidence matrix of a 1-configuration based on a rectangular integer lattice, and the girth-eight property is achieved by a judicious selection of sets of parallel lines included in a configuration. A class of codes with a wide range of lengths and column weights is obtained. The resulting matrix of parity checks is an array of circulant matrices.
Bane Vasic, Karunakar Pedagani, Milos Ivkovic
IEEE Trans. Commun.2
2003 A runlength limited low-density parity-check coding scheme
abstract
In this paper, we propose a novel approach to modulation and error control coding. The idea is to completely eliminate a constrained code and, instead, impose the constraint by the deliberate introduction of bit errors before transmission. The redundancy that would have been used for imposing the constraint is used in our scheme to strengthen the error control code (ECC), in such a way that the ECC becomes capable of correcting both deliberate errors as well as channel errors that occurs during the detection. The proposed ECC-modulation scheme is based on iterative decoding of low-density parity-check codes (LDPC) and a runlength constraint.
Bane Vasic, Karunakar Pedagani
ICC2