Parameters of BCH codes
PhD Thesis Proposal Defence
Title: "Parameters of BCH codes"
Mr. Hao LIU
The theory of error-correcting codes is a key pillar in modern digital
communications. By introducing redundancy into codewords, error-correcting
codes make messages robust again noises in communication channels. In
1948, Shannon proved that arbitrarily reliable communications are possible
with the help of error-correcting codes. Thereafter, researchers have been
exploring proper codes with efficient encoding and decoding algorithms.
BCH codes are a family of cyclic codes with guaranteed error-correcting
capabilities and efficient decoding algorithms. They are employed in a
wide range of applications from satellite communications to solid-state
drives. However, their dimensions and minimum distances are seldom
In this thesis, we will investigate the parameters of BCH codes.
Dimensions of BCH codes with three different lengths will be determined,
in a much larger range of defining sets than in previous literature. In
some cases, we will determine the dimensions of BCH codes constructed from
every feasible defining set within an interval; in other cases, we will
discuss a few BCH codes with chosen defining sets. For minimum distances
of BCH codes, we will highlight a few cases where the true minimum
distances can be determined by innovative methods.
Date: Monday, 15 January 2018
Time: 2:00pm - 4:00pm
Venue: Room 3494
Committee Members: Prof. Cunsheng Ding (Supervisor)
Dr. Ke Yi (Chairperson)
Dr. Dimitris Papadopoulos
Dr. Maosheng Xiong (MATH)
**** ALL are Welcome ****