alexa A CLOSER LOOK INTO THE RECTANGULAR CODES: WHERE THE PAR
ISSN: 1948-1432

Journal of Global Research in Computer Sciences
Open Access

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations

700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Review Article

A CLOSER LOOK INTO THE RECTANGULAR CODES: WHERE THE PARITY CHECK PREDOMINATES

Romi Banerjee*1, Saptarshi Naskar2 and Samar Sen Sarma3
  1. Department of Computer Science and Engineering, University of Calcutta, Kolkata, West Bengal, India
  2. Department of Computer Science, Sarsuna College, Kolkata, West Bengal, India
  3. Department of Computer Science and Engineering, University of Calcutta, Kolkata, West Bengal, India
Corresponding Author: Romi Banerjee, E-mail: [email protected]
Related article at Pubmed, Scholar Google
 

Abstract

Information transmission in the presence of „white noise‟ is error prone, but is not as elusive as any arbitrary noise prone channel. With respect to this restriction, the parity check is the only feasible error handling scheme that could be adopted in, at least, any intra-system digital communication (e.g. All existing computing systems use the ASCII codes); while the repetition of messages (e.g. The triplicate transmission scheme) is not a viable alternative. In this paper, we propose simple algorithms to clearly prove the greater practical efficiency of the 2-dimensional parity check based coding systems in the „rectangular‟ framework – as opposed to the established notion of the „square code‟ being more efficient. These algorithms are further corroborated by theorems, associated hypotheses and experimental results. The lower and the upper bound of our algorithms are clearly explained.

Keywords

Share This Page

Additional Info

Loading
Loading Please wait..
Peer Reviewed Journals
 
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
 
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

 
© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version
adwords