### Skapa referens, olika format (klipp och klistra)

**Harvard**

Xiao, M. (2007) *Efficient Coding Techniques for Networks & Channels with Transmission Errors*. Göteborg : Chalmers University of Technology (Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie, nr: 2680).

** BibTeX **

@book{

Xiao2007,

author={Xiao, Ming},

title={Efficient Coding Techniques for Networks & Channels with Transmission Errors},

isbn={978-91-7291-999-0},

abstract={This thesis consists of two parts, both of which
investigate coding techniques for information transmission through
channels in the presence of errors. Part I discusses topics of
network coding and rateless codes. Part~II considers channel codes
for continuous phase modulation. These two parts are clearly
different, but they are also related.
In Part I, we first discuss the bit error probability (BEP) in the
sinks. We develop algorithms to calculate the sink BEP for both
binary codes and nonbinary codes. The results can be exact or
approximate, with different computational complexity. Then, we
discuss optimal sink decoding problems. We show that the
statistical information of upstream channels is critical to the
decoders. We propose analysis bounds for the different decoding
schemes. Then, we investigate the binary coding approach for
combination networks. Our codes are deterministic, and achieve
min-cut capacities with only cyclic shifting and XOR operations.
We propose a binary rateless coding scheme for general (in
topology) networks with erasure networks. The codes have merits of
small block magnitude and very small overheads (near maximum
distance separable). Finally, we investigate cross-layer design
approaches for random rateless network codes.
For Part II, we first investigate serially concatenated continuous
phase modulation (SCCPM) with convolutional codes (CC) over rings.
The properties for systems with both infinite and finite block
lengths are investigated. Compared to previous SCCPM with a binary
CC, the proposed system shows an improvement concerning the
convergence threshold or error floors. Then, we investigate the
analysis and design of low density generator matrix codes for CPM.
We discuss systems with a finite block length. We also consider a
rate-adaptive system for slowly fading channels. A significant
energy saving is found from non-adaptive schemes.},

publisher={Institutionen för data- och informationsteknik, Datorteknik (Chalmers), Chalmers tekniska högskola,},

place={Göteborg},

year={2007},

series={Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie, no: 2680Technical report - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, no: 35D},

keywords={Network Coding, Channels with Errors, Sink Bit Error Probability, Maximum-Likelihood Decoding, Deterministic Rateless Codes, Cross-Layer Design; Continuous Phase Modulation, Ring Convolutional Codes, Low-Density Generation-Matrix Codes, Adaptive Codes.},

note={224},

}

** RefWorks **

RT Dissertation/Thesis

SR Print

ID 55264

A1 Xiao, Ming

T1 Efficient Coding Techniques for Networks & Channels with Transmission Errors

YR 2007

SN 978-91-7291-999-0

AB This thesis consists of two parts, both of which
investigate coding techniques for information transmission through
channels in the presence of errors. Part I discusses topics of
network coding and rateless codes. Part~II considers channel codes
for continuous phase modulation. These two parts are clearly
different, but they are also related.
In Part I, we first discuss the bit error probability (BEP) in the
sinks. We develop algorithms to calculate the sink BEP for both
binary codes and nonbinary codes. The results can be exact or
approximate, with different computational complexity. Then, we
discuss optimal sink decoding problems. We show that the
statistical information of upstream channels is critical to the
decoders. We propose analysis bounds for the different decoding
schemes. Then, we investigate the binary coding approach for
combination networks. Our codes are deterministic, and achieve
min-cut capacities with only cyclic shifting and XOR operations.
We propose a binary rateless coding scheme for general (in
topology) networks with erasure networks. The codes have merits of
small block magnitude and very small overheads (near maximum
distance separable). Finally, we investigate cross-layer design
approaches for random rateless network codes.
For Part II, we first investigate serially concatenated continuous
phase modulation (SCCPM) with convolutional codes (CC) over rings.
The properties for systems with both infinite and finite block
lengths are investigated. Compared to previous SCCPM with a binary
CC, the proposed system shows an improvement concerning the
convergence threshold or error floors. Then, we investigate the
analysis and design of low density generator matrix codes for CPM.
We discuss systems with a finite block length. We also consider a
rate-adaptive system for slowly fading channels. A significant
energy saving is found from non-adaptive schemes.

PB Institutionen för data- och informationsteknik, Datorteknik (Chalmers), Chalmers tekniska högskola,

T3 Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie, no: 2680Technical report - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, no: 35D

LA eng

OL 30