On the decoding complexity of cyclic codes up to the BCH bound

SCHIPANI, D., ELIA, M. and ROSENTHAL, J., 2011. On the decoding complexity of cyclic codes up to the BCH bound. In: Proceedings IEEE International Symposium on Information Theory (ISIT).

Full text not available from this repository.
Item Type: Conference contribution
Creators: Schipani, D., Elia, M. and Rosenthal, J.
Date: 2011
Divisions: Schools > School of Science and Technology
Depositing User: EPrints Services
Date Added: 09 Oct 2015 09:51
Last Modified: 19 Oct 2015 14:24
URI: http://irep.ntu.ac.uk/id/eprint/3977

Actions (login required)

Edit View Edit View

Views

Views per month over past year

Downloads

Downloads per month over past year