# EECS 246 Network Coding: Theory and Applications (2013-2014)

#### EECS 246 Network Coding: Theory and Applications

**EECS 246 Network Coding: Theory and Applications (Credit Units: 4)** Theoretical frameworks for network coding: linear, algebraic and random network coding; linear programming and combinatorial frameworks. Network code design. Benefits and costs. Practical network coding. Applications to wireless networks, content distribution, security, and other areas. Prerequisite: EECS248A or Networked Systems 201 or Computer Science 232. Graduate students only. Same as NET SYS 256. (Design units: 0)

Additional course notes and handouts will be provided.

Internet (EECS248A/NetSys201/CompSci232) and Linear Algebra (at the undergraduate level).

- Basic principles of network coding, costs and benefits.
- Network code design.
- Algebraic, random, combinatorial, and linear programming frameworks for studying network coding.
- Practical network coding and deployment issues.
- Applications to wireless networks, content distribution, security and other emerging application areas.

Meets for 3 hours of lecture each week for 10 weeks.

Matlab may be used as part of the homework and term project.

None.

None.

None.

- Homework: 20%
- Term Project: 40%
- Final: 40%
- Total: 100%

Mathematics and Basic Science: 0.0 credit units

Computing: 0.0 credit units

Engineering Topics: 0.0 credit units

Engineering Science: 0.0 credit units

Engineering Design: 0.0 credit units