Sciweavers

1085 search results - page 20 / 217
» Hug over a distance
Sort
View
JGT
2008
91views more  JGT 2008»
13 years 8 months ago
On the editing distance of graphs
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
Maria Axenovich, André E. Kézdy, Rya...
WACV
2002
IEEE
14 years 1 months ago
Using attribute trees to analyse auroral appearance over Canada
Modern space research uses both satellite-born and ground-based instruments to measure the near-Earth space environment. Studying the auroral display provides information of the e...
Mikko T. Syrjäsuo, Eric F. Donovan, Markus Pe...
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 8 months ago
Coding over an Erasure Channel with a Large Alphabet Size
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...
TCOM
2008
106views more  TCOM 2008»
13 years 8 months ago
Performance analysis on LDPC-Coded systems over quasi-static (MIMO) fading channels
In this paper, we derive closed form upper bounds on the error probability of low-density parity-check (LDPC) coded modulation schemes operating on quasi-static fading channels. Th...
Jingqiao Zhang, Heung-No Lee
TCOM
2008
151views more  TCOM 2008»
13 years 7 months ago
Design of regular (2, dc)-LDPC codes over GF(q) using their binary images
In this paper, a method to design regular (2, dc)-LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of thei...
Charly Poulliat, Marc P. C. Fossorier, David Decle...