Fall 2014

Course info
Previous terms


6.02 only:
* Online grades
* PSets:
* Help queue
* Lab hours
* Staff only

6.02 Handouts

Lectures The course notes ("text") are in three parts, reflecting the three themes in 6.02: bits, signals, and packets. Each part has multiple chapter. The table below specifies the relevant chapters and/or sections for each lecture. Please send any questions/comments/suggestions on the notes to hari.

  • Part 1: Bits: Chapters 1~8
  • Part 2: Signals: Chapters 9~14
  • Part 3: Packets: Chapters 16~19

    Lecture Lecture Slides & Notes Class Notes Solutions Quiz
    L01: Overview. Information & entropy slides Ch 1, 2, §3.1
    Ch. 2 Quiz 1
    L02: Compression: Huffman & LZW slides
    lecture notes
    Ch 3 Ch. 3
    L03: Errors, Hamming distance slides
    lecture notes
    Ch 4
    (skip §4.4 and §4.5),
    L04: Linear block codes, Hamming codes slides
    lecture notes
    Ch 5, §6.1 Ch. 5
    L05: Hamming codes, Error correction (syndrome decoding) slides
    lecture notes
    §6.2-6.5 (Not §6.6)
    L06: Convolutional codes slides (without animations)
    lecture notes
    Ch 7
    L07: Viterbi decoding slides
    lecture notes (with diagrams)
    Ch 8
    L08: Noise slides Ch 9 Ch 9 Quiz 2
    L09: Bit detection in noise slides §10.1
    L10: Physical channel, LTI models of baseband channel slides Ch 10, §11.3
    L11: Step response, superposition, convolution slides Ch 11 (Not §11.4) Ch 11
    L12: Channel frequency response slides Ch 12 Ch 12
    L13: Filtering slides Ch 12
    L14: Spectral content of signals slides Ch 13 (Only §13.1) Ch 13
    L15: Modulation/demodulation slides Ch 14
    L16: Demodulation & frequency division multiplexing slides Ch 14
    L17: Review board photos
    L18: MAC protocols slides
    lecture notes
    ALOHA math and Unslotted ALOHA (not done in lecture)
    Ch 15 Quiz 3
    L19: Multi-hop networks, queues slides
    lecture notes
    Ch 16
    L20: Routing protocols without failure slides
    lecture notes
    Ch 17
    L21: Routing protocols with failure slides
    lecture notes
    dictionary of networking terms (updated for Lecture 21)
    Ch 18
    L22: Reliable data transport Ch 19
    L23: Improving throughput with sliding windows Ch 19
    L24: A brief history of the Internet
    L25: Digital communciations end-to-end

  • Course notes by chapter
    1. Introduction
    2. Information, Entropy, and the Motivation for Source Codes
    3. Compression Algorithms: Huffman and LZW
    4. Digital Signaling and Communication Abstractions
    5. Coping with Bit Errors using Error Correction Codes
    6. Linear Block Codes: Encoding and Syndrome Decoding
    7. Convolutional Codes: Construction and Encoding
    8. Viterbi Decoding of Convolutional Codes
    9. Noise
    10. Models for Physical Communication Channels
    11. LTI Models and Convolution
    12. Frequency Response of LTI Systems
    13. Fourier Analysis and Spectral Representation of Signals
    14. Modulation and Demodulation
    15. Sharing a Channel: Media Access (MAC) Protocols
    16. Communication Networks: Sharing and Switches
    17. Network Routing - I: Without Any Failures
    18. Network Routing - II: Routing Around Failures
    19. Reliable Data Transport Protocols

    Occasional notes from recitation sections The recitation instructors' personal notes are provided by them when and if they feel these may be helpful for a particular recitation, but please don't count on there being notes from each (or even any) instructor for each recitation. Also, each recitation instructor has considerable latitude in determining his teaching plan and choosing problems for discussion. Some of this material may be specific to a particular section, and such material will not be required for the quizzes or problem sets.

    Background and other readings The following material may be useful as background or augmentation. They are not required for the course per se.

    Quiz solutions
    1. Quiz 1
    2. Quiz 2