Some improved encoding and decoding schemes for balanced codes

Jong Hoon Youn, Bella Bose

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

A binary code of length n is called a balanced code if each codeword contains exactly [n/2] (or [n/2]) ones and [n/2] (or [n/2]) zeros. In this paper, we give two improved methods for encoding and decoding balanced codes. The first one, called improved single map, improves the computation complexity of Knuth's single map function. This method, instead of complementing one bit at a time as done in Knuth's method, complements several appropriate bits at a time. Some simulation results show the improvement of this scheme over the previously known methods. The second one is a parallel implementation of this method.

Original languageEnglish (US)
Title of host publicationProceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC
Pages103-109
Number of pages7
ISBN (Electronic)0769509754
DOIs
StatePublished - Jan 1 2000

Fingerprint

Decoding
Binary codes

Keywords

  • Binary codes
  • Block codes
  • Computer science
  • Decoding
  • Encoding
  • Fault tolerance
  • Fiber lasers
  • Laser transitions
  • Magnetic circuits
  • Very large scale integration

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Hardware and Architecture
  • Software

Cite this

Youn, J. H., & Bose, B. (2000). Some improved encoding and decoding schemes for balanced codes. In Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC (pp. 103-109). [897291] https://doi.org/10.1109/PRDC.2000.897291

Some improved encoding and decoding schemes for balanced codes. / Youn, Jong Hoon; Bose, Bella.

Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC. 2000. p. 103-109 897291.

Research output: Chapter in Book/Report/Conference proceedingChapter

Youn, JH & Bose, B 2000, Some improved encoding and decoding schemes for balanced codes. in Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC., 897291, pp. 103-109. https://doi.org/10.1109/PRDC.2000.897291
Youn JH, Bose B. Some improved encoding and decoding schemes for balanced codes. In Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC. 2000. p. 103-109. 897291 https://doi.org/10.1109/PRDC.2000.897291
Youn, Jong Hoon ; Bose, Bella. / Some improved encoding and decoding schemes for balanced codes. Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC. 2000. pp. 103-109
@inbook{54976aec1d2a4bbdbaa741b693a93d70,
title = "Some improved encoding and decoding schemes for balanced codes",
abstract = "A binary code of length n is called a balanced code if each codeword contains exactly [n/2] (or [n/2]) ones and [n/2] (or [n/2]) zeros. In this paper, we give two improved methods for encoding and decoding balanced codes. The first one, called improved single map, improves the computation complexity of Knuth's single map function. This method, instead of complementing one bit at a time as done in Knuth's method, complements several appropriate bits at a time. Some simulation results show the improvement of this scheme over the previously known methods. The second one is a parallel implementation of this method.",
keywords = "Binary codes, Block codes, Computer science, Decoding, Encoding, Fault tolerance, Fiber lasers, Laser transitions, Magnetic circuits, Very large scale integration",
author = "Youn, {Jong Hoon} and Bella Bose",
year = "2000",
month = "1",
day = "1",
doi = "10.1109/PRDC.2000.897291",
language = "English (US)",
pages = "103--109",
booktitle = "Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC",

}

TY - CHAP

T1 - Some improved encoding and decoding schemes for balanced codes

AU - Youn, Jong Hoon

AU - Bose, Bella

PY - 2000/1/1

Y1 - 2000/1/1

N2 - A binary code of length n is called a balanced code if each codeword contains exactly [n/2] (or [n/2]) ones and [n/2] (or [n/2]) zeros. In this paper, we give two improved methods for encoding and decoding balanced codes. The first one, called improved single map, improves the computation complexity of Knuth's single map function. This method, instead of complementing one bit at a time as done in Knuth's method, complements several appropriate bits at a time. Some simulation results show the improvement of this scheme over the previously known methods. The second one is a parallel implementation of this method.

AB - A binary code of length n is called a balanced code if each codeword contains exactly [n/2] (or [n/2]) ones and [n/2] (or [n/2]) zeros. In this paper, we give two improved methods for encoding and decoding balanced codes. The first one, called improved single map, improves the computation complexity of Knuth's single map function. This method, instead of complementing one bit at a time as done in Knuth's method, complements several appropriate bits at a time. Some simulation results show the improvement of this scheme over the previously known methods. The second one is a parallel implementation of this method.

KW - Binary codes

KW - Block codes

KW - Computer science

KW - Decoding

KW - Encoding

KW - Fault tolerance

KW - Fiber lasers

KW - Laser transitions

KW - Magnetic circuits

KW - Very large scale integration

UR - http://www.scopus.com/inward/record.url?scp=0141795920&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141795920&partnerID=8YFLogxK

U2 - 10.1109/PRDC.2000.897291

DO - 10.1109/PRDC.2000.897291

M3 - Chapter

AN - SCOPUS:0141795920

SP - 103

EP - 109

BT - Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC

ER -