activity
20052011
most citedOn Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings

138 citations · 251 across the 6 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2011★ 5 cited

On Inverses for Quadratic Permutation Polynomials over Integer Rings

Jonghoon Ryu, Oscar Y. Takeshita

Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communica…

cs.IT2006★ 97 cited

Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective

Oscar Y. Takeshita

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are important because they admit analytical designs and simple, pr…

cs.IT2005★ 1 cited

On Quadratic Inverses for Quadratic Permutation Polynomials over Integer Rings

Jonghoon Ryu, Oscar Y. Takeshita

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs a…

cs.IT2005★ 10 cited

A New Construction for LDPC Codes using Permutation Polynomials over Integer Rings

Oscar Y. Takeshita

A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes…

cs.IT2005★ 138 cited

On Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings

Oscar Y. Takeshita

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs a…