Coding theory question

[ffaaeemm]

hi , I have two question , plz help me
i no time
1.Show that a narrow-sense binary BCH code of length n = 2m − 1 and
designed distance 2t + 1 has minimum distance 2t + 1, provided that
in attachment 1

2.Determine whether the dual of an arbitrary BCH code is a BCH code.

tanks
I'm waiting.... :'):SugarwareZ-220:

 

[ffaaeemm]

hi , I have two question , plz help me
i no time :SugarwareZ-096::SugarwareZ-032::SugarwareZ-032::SugarwareZ-032::SugarwareZ-096::SugarwareZ-096::SugarwareZ-203::SugarwareZ-203:
1.Show that a narrow-sense binary BCH code of length n = 2^m − 1 and
designed distance2^t+1 has minimum distance2^t+1, provided that
in attachment 1

2.Determine whether the dual of an arbitrary BCH code is a BCH code.

tanks
I'm waiting.... :'):SugarwareZ-220:

I have two question , plz help me
i no time :SugarwareZ-096::SugarwareZ-032::SugarwareZ-032::SugarwareZ-032::SugarwareZ-096::SugarwareZ-096::SugarwareZ-203::SugarwareZ-203:
1.Show that a narrow-sense binary BCH code of length n = 2^m − 1 and
designed distance2^t+1 has minimum distance2^t+1, provided that
in attachment 1

2.Determine whether the dual of an arbitrary BCH code is a BCH code.

tanks
I'm waiting.... :'):SugarwareZ-220:[/QUOTE]