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 231A · EE 231AInformation Theory

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

See treeView official UCLA course listing ↗Find on Bruinwalk ↗

Fundamentals information compression, transmission, processing, and learning. Topics include limits and algorithms for lossless data compression, connections to model estimation and learning, channel capacity, rate versus distortion in lossy compression, and basics of information theory for networks.

Letter grading.

When it runs

  • Fall 2025
  • Fall 2026

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

Requisites

Official UCLA wording

Requisite: course 131A.

BruinTree reads · Prerequisite

confidence 1.00 · from text
EC ENGR 131A

Report a problem

About EC ENGR 231A. 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.

EC ENGR 231A

  • EC ENGR 131AProbability and Statistics
    • MATH 32BCalculus of Several Variables
      • MATH 31BIntegration and Infinite Series1 more beneath
      • MATH 32ACalculus of Several Variables1 more beneath
    • MATH 33BDifferential Equations
      • MATH 31BIntegration and Infinite Seriesanother path to it

1 direct requisite. Showing 6 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.

Unlocks

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

EC ENGR 231A

  • EC ENGR 231BNetwork Information Theory

1 course lists this as a requisite. The whole downstream is here — 1 course over 1 level. Every course here opens its own tree.