<--- Back to Details
First PageDocument Content
Telecommunications engineering / Discrete mathematics / Convolutional code / Turbo code / Additive white Gaussian noise / Puncturing / Forward error correction / Concatenated error correction code / Error detection and correction / Coding theory / Information
Date: 2007-06-29 06:52:43
Telecommunications engineering
Discrete mathematics
Convolutional code
Turbo code
Additive white Gaussian noise
Puncturing
Forward error correction
Concatenated error correction code
Error detection and correction
Coding theory
Information

Add to Reading List

Source URL: www.cl.cam.ac.uk

Download Document from Source Website

File Size: 155,10 KB

Share Document on Facebook

Similar Documents

Mathematical logic / Proof theory / Logic / Mathematics / Natural deduction / Sequent calculus / Sequent / First-order logic / Admissible rule / Conjunctive normal form / Quantifier / Cut-elimination theorem

Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1 Institute of Discrete Mathematics and Geometry, Vienna University of Technology

DocID: 1xTCQ - View Document

Wombat / Mongoose

Using Alloy in a Language Lab Approach to Introductory Discrete Mathematics Charles Wallace Michigan Technological University In collaboration with Laura Brown, Adam Feltz

DocID: 1xTvc - View Document

Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.bg.ac.yu Appl. Anal. Discrete Math), 322–337. doi:AADM100425018H

DocID: 1vmuF - View Document

Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1–1 A lower bound for approximating the grundy number

DocID: 1vkug - View Document

Hausdorff Center for Mathematics, Summer School (May 9–13, 2016) Problems for “Discrete Convex Analysis” (by Kazuo Murota) Problem 1. Prove that a function f : Z2 → R defined by f (x1 , x2 ) = φ(x1 − x2 ) is

DocID: 1vjVY - View Document