Loading

BruinTree is an independent student project. It is not affiliated with, endorsed by, or sponsored by UCLA or the University of California. Where this comes from›

Course information comes from the public UCLA General Catalog. Requisites are read from UCLA’s published wording and can be incomplete or out of date — check the official catalog listing and your department adviser before you enroll.

UCLA, Bruin, and related marks are trademarks of The Regents of the University of California.

Report a problem

Anonymous, and it takes a sentence. This is the main way BruinTree finds out what it has got wrong.

What kind of problem

Sends this page’s address and your browser version. Nothing else.

EC ENGR 234A · EE 234ANetwork Coding Theory and Applications

Electrical and Computer Engineering · 4 units · Graduate courses (200-299)

See treeView official UCLA course listing ↗Find on Bruinwalk ↗

Algebraic approach and main theorem in network coding, combinatorial approach and alphabet size, linear programming approach and throughput benefits, network code design algorithms, secure network coding, network coding for wireless, other applications.

Letter grading.

When it runs

  • Fall 2026

Scheduled, not typical — from UCLA’s Schedule of Classes, which publishes Fall 2025 through Spring 2027 and nothing before it.

Requisites

UCLA lists no requisites for this course.

Report a problem

About EC ENGR 234A. We read UCLA’s requisite wording by machine, and it gets things wrong.

What kind of problem

Sends this page’s address and your browser version. Nothing else.

Requires

Everything that has to come before this course, not just the courses named in the requisite above.

Nothing — this is an entry point.

Unlocks

What this course is a requisite for, and what those courses lead to in turn.

No course in the catalog lists this as a requisite.