An N-Square Approach for Reduced Complexity Non-Binary Encoding

α
dr_g._srinivas
dr_g._srinivas
σ
Dr. G.Srinivas; P.V.G.D.Prasad Reddy; K.Ramya
Dr. G.Srinivas; P.V.G.D.Prasad Reddy; K.Ramya

Send Message

To: Author

An  N-Square Approach for Reduced Complexity Non-Binary Encoding

Article Fingerprint

ReserarchID

87E99

An  N-Square Approach for Reduced Complexity Non-Binary Encoding Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

Abstracts -There is always a need for the compression of data to facilitate its easy transmission and storage. Several lossy and lossless techniques have been developed in the past few decades. Lossless techniques allow compression without any loss of information. In this paper, we propose a new algorithm for lossless compression. Our experimental results show that the proposed algorithm performs compression in lesser iterations than the existing Non-Binary Huffman coding without affecting the average number of digits required to represent the symbols, thereby reducing the complexity involved during the compression process.

References

10 Cites in Article
  1. S Jayaram,S Esakkirajan,T Veerakumar Digital Image Processing.
  2. Rafel Gonzalez,Richard Woods (2009). Digital Image Processing.
  3. S Annadurai,R Shanmughalakshmi Fundamental of Digital Image processing.
  4. David A Huffman,Associate,Ire (1952). A Method for the Construction of Minimum-Redundancy Codes.
  5. Cebrail Taskin,Serdar Sarikoz (2008). An Overview of Image Compression Approaches.
  6. Guojun Lu (1993). Advances in digital image compression techniques.
  7. Bei Chen,Hong-Cai Zhang,Wen-Lun Cao,Jian-Hu Feng (2007). Huffman Coding Method based on Number Character.
  8. Reza Hashemian Direct Huffman Coding and Decoding using the table of Code-Lengths.
  9. Ying Jia-Yu Lin,Ke-Chu Liu,Yi (2004). Balance of 0,1 Bits for Huffman and Reversible Variable-Length Coding.
  10. B Swarupa (2010). Analytical Approach For Decoder Delay Reduction Sec-DEDDAEC Codes Derived From Orthogonal Latin Square Codes.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

dr_g._srinivas. 1970. \u201cAn N-Square Approach for Reduced Complexity Non-Binary Encoding\u201d. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 11): .

Download Citation

Issue Cover
GJCST Volume 11 Issue 11
Pg. 37- 39
Journal Specifications
Keywords
Version of record

v1.2

Issue date

July 6, 2011

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 20556
Total Downloads: 11093
2026 Trends
Related Research

Published Article

Abstracts -There is always a need for the compression of data to facilitate its easy transmission and storage. Several lossy and lossless techniques have been developed in the past few decades. Lossless techniques allow compression without any loss of information. In this paper, we propose a new algorithm for lossless compression. Our experimental results show that the proposed algorithm performs compression in lesser iterations than the existing Non-Binary Huffman coding without affecting the average number of digits required to represent the symbols, thereby reducing the complexity involved during the compression process.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

An N-Square Approach for Reduced Complexity Non-Binary Encoding

Dr. G.Srinivas; P.V.G.D.Prasad Reddy; K.Ramya
Dr. G.Srinivas; P.V.G.D.Prasad Reddy; K.Ramya

Research Journals