71 search results - page 8 / 15 » Bijective Linear Time Coding and Decoding for k-Trees |
IMA
1995
Springer
13 years 11 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
GLOBECOM
2009
IEEE
13 years 5 months ago
2009
IEEE
We consider the uplink of two mobile stations with the help of one common relay. Recently, joint network-channel coding based on LDPC codes was proposed for this setup where the ch...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them ...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper, distributed double-differential coding is proposed to avoid the problem of carrier offsets in amplify and forward protocol based cooperative network with two rel...
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...