Search Results - "Forney, G.D."

On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit by Sae-Young Chung, Forney, G.D., Richardson, T.J., Urbanke, R.

“…We develop improved algorithms to construct good low-density parity-check codes that approach the Shannon limit very closely. For rate 1/2, the best code found…”
Get full text

Modulation and coding for linear Gaussian channels by Forney, G.D., Ungerboeck, G.

“…Shannon's determination of the capacity of the linear Gaussian channel has posed a magnificent challenge to succeeding generations of researchers. This paper…”
Get full text

Sphere-bound-achieving coset codes and multilevel coset codes by Forney, G.D., Trott, M.D., Sae-Young Chung

“…A simple sphere bound gives the best possible tradeoff between the volume per point of an infinite array L and its error probability on an additive white…”
Get full text

Dimension/length profiles and trellis complexity of linear block codes by Forney, G.D.

“…This semi-tutorial paper discusses the connections between the dimension/length profile (DLP) of a linear code, which is essentially the same as its…”
Get full text

The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders by Forney, G.D., Trott, M.D.

“…A group code C over a group G is a set of sequences of group elements that itself forms a group under a component-wise group operation. A group code has a…”
Get full text

Codes on graphs: normal realizations by Forney, G.D.

“…A generalized state realization of the Wiberg (1996) type is called normal if symbol variables have degree 1 and state variables have degree 2. A natural…”
Get full text

On quantum detection and the square-root measurement by Eldar, Y.C., Forney, G.D.

“…We consider the problem of constructing measurements optimized to distinguish between a collection of possibly nonorthogonal quantum states. We consider a…”
Get full text

Convolutional and Tail-Biting Quantum Error-Correcting Codes by Forney, G.D., Grassl, M., Guha, S.

“…Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes…”
Get full text

Optimal tight frames and quantum measurement by Eldar, Y.C., Forney, G.D.

“…Tight frames and rank-one quantum measurements are shown to be intimately related. In fact, the family of normalized tight frames for the space in which a…”
Get full text

Random codes: minimum distances and error exponents by Barg, A., Forney, G.D.

“…Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes from Shannon's random code…”
Get full text

Trellis shaping by Forney, G.D.

“…The author discusses trellis shaping, a method of selecting a minimum-weight sequence from an equivalence class of possible transmitted sequences by a search…”
Get full text

Minimal tail-biting trellises: the Golay code and more by Calderbank, A.R., Forney, G.D., Vardy, A.

“…Tail-biting trellis representations of block codes are investigated. We develop some elementary theory, and present several intriguing examples, which we hope…”
Get full text

Geometrically uniform codes by Forney, G.D.

“…A signal space code C is defined as geometrically uniform if, for any two code sequences in C, there exists an isometry that maps one sequence into the other…”
Get full text

The dynamics of group codes: Dual abelian group codes and systems by Forney, G.D., Trott, M.D.

“…Fundamental results concerning the dynamics of abelian group codes (behaviors) and their duals are developed. Duals of sequence spaces over locally compact…”
Get full text

Codes on graphs: constraint complexity of cycle-free realizations of linear codes by Forney, G.D.

“…Cycle-free graphical realizations of linear codes generalize trellis realizations. Given a linear code C and a cycle-free graph topology, there exists a…”
Get full text

Trellis precoding: combined coding, precoding and shaping for intersymbol interference channels by Eyuboglu, M.V., Forney, G.D.

“…On a linear Gaussian channel with intersymbol interference (ISI), trellis precoding is a method that achieves the equalization performance of…”
Get full text

Generalized minimum-distance decoding of Euclidean-space codes and lattices by Forney, G.D., Vardy, A.

“…It is shown that multistage generalized minimum-distance (GMD) decoding of Euclidean-space codes and lattices can provide an excellent tradeoff between…”
Get full text

V.92: the last dial-up modem? by Dae-Young Kim, Humblet, P.A., Eyuboglu, M.V., Brown, L., Forney, G.D., Mehrabanzad, S.

“…Ever since the first dial-up modems appeared in the 1960s, their obsolescence has been repeatedly predicted. However, contrary to such predictions, dial-up…”
Get full text

Introduction to the special issue on codes on graphs and iterative algorithms by Frey, B.J., Koetter, R., Forney, G.D., Kschischang, F.R., McEliece, R.J., Spielman, D.A.

Get full text

Density/length profiles and trellis complexity of lattices by Forney, G.D.

“…The density/length profile (DCP) of a lattice /spl Lambda/ is analogous to the dimension/length profile of a linear code. The DLP is a geometrical invariant of…”
Get full text