Digital system design and microprocessors
Digital system design and microprocessors
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Introduction to algorithms
IEEE Transactions on Computers
Efficient q-ary immutable codes
Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Computer Architecture in the 1990s
Computer
Codes for Detecting and Correcting Unidirectional Errors
Codes for Detecting and Correcting Unidirectional Errors
Design of Efficient Balanced Codes
IEEE Transactions on Computers
Delay-Insensitive Pipelined Communication on Parallel Buses
IEEE Transactions on Computers
Limitations of VLSI implementation of delay-insensitive codes
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Noise Reduction Using Low Weight and Constant Weight Coding Techniques
Noise Reduction Using Low Weight and Constant Weight Coding Techniques
Balanced codes with parallel encoding and decoding
Balanced codes with parallel encoding and decoding
Design of some new efficient balanced codes
IEEE Transactions on Information Theory
Balanced Codes with Parallel Encoding and Decoding
IEEE Transactions on Computers
Self-Complementary Balanced Codes and Quasi-Symmetric Designs
Designs, Codes and Cryptography
Undetected error probability of q-ary constant weight codes
Designs, Codes and Cryptography
Index to constant weight codeword converter
ARC'11 Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applications
| Hi-index | 14.99 |
A constant weight, w, code with k information bits and r check bits is a binary code of length n = k + r and cardinality 2k such that the number of 1s in each code word is equal to w. When $w = \lfloor n/2 \rfloor,$ the code is called balanced. This paper describes the design of balanced and constant weight codes with parallel encoding and parallel decoding. Infinite families of efficient constant weight codes are given with the parameters k, r, and the "number of balancing functions used in the code design," p. The larger p grows, the smaller r will be; and the codes can be encoded and decoded with VLSI circuits whose sizes and depths are proportional to pk and log2p, respectively. For example, a design is given for a constant weight w = 33 code with k = 64 information bits, r = 10 check bits, and p = 8 balancing functions. This code can be implemented by a VLSI circuit using less than 4,054 transistors with a depth of less than 30 transistors.