Seminar: Sphere Packing Bound

Thời gian: 13:20 đến 15:20 Ngày 28/05/2025

Địa điểm: Phòng B102, VIASM

Báo cáo viên: Hà Văn Hiếu (Trường Đại học Kinh tế - Luật Tp. Hồ Chí Minh)

Tóm tắt: Building on the previous talk, we now shift our focus to the fundamental processes of encoding and decoding in error-correcting codes. We begin by exploring how information is systematically transformed into codewords through encoding, enabling efficient and reliable data transmission. In this context, we introduce Shannon’s Theorem—one of the cornerstones of information theory—which defines the theoretical limits for achieving reliable communication over noisy channels. To conclude, we will adopt a geometric viewpoint by examining the Sphere Packing Bound. This concept sets an upper limit on the number of codewords a code can contain, based on its ability to correct errors, and provides insight into the structure and optimality of error-correcting codes.