Document Type

Conference Proceeding

Publisher

IEEE

Faculty

Faculty of Computing, Health and Science

School

School of Computer and Information Science

RAS ID

2820

Comments

This is an Author's Accepted Manuscript of: Moore, J.B., & Tan, K.T. (2005). Multinomial Representation of Majority Logic Coding. Proceedings of IEEE International Symposium on Information Theory. ISIT 2005 (pp. 421-424). Adelaide, Australia. IEEE. Available here

© 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Abstract

Multinomial representations are derived for majority logic operations on bipolar binary data. The coefficients are given simply in terms of the readily computed lower Cholesky factor of Pascal matrices of order n for codes of block length n

DOI

10.1109/ISIT.2005.1523368

Access Rights

free_to_read

Share

 
COinS
 

Link to publisher version (DOI)

10.1109/ISIT.2005.1523368