Volume 11, Issue 5, May – 2026 International Journal of Innovative Science and Research Technology

ISSN No : -2456-2165 [Link]

Data Compression Using Huffman Coding &

Decoding in MATLAB

Pulak Kumar Jena1; Ramkumar Ghadai2; Sudarshan Murmu3; Binod Kumar

Baliar Sing4
1,2,3,4
Konark Institute of Science & Technology , Jatani Khurda

Publication Date: 2026/06/04

Abstract: The rapid advancement of digital communication systems and multimedia technologies has significantly increased
the amount of data generated, transmitted, and stored across computer networks. As a result, efficient data compression
techniques have become essential for minimizing storage requirements and reducing transmission bandwidth while
maintaining data integrity. Data compression is a process that eliminates redundancy from digital information to represent
data using fewer bits than the original format. Among various lossless compression techniques, Huffman Coding remains
one of the most effective and widely adopted methods due to its simplicity, optimality, and efficient implementation
characteristics.

Huffman Coding is a statistical compression technique that generates variable-length binary codes based on the
probability of occurrence of symbols within a dataset. Frequently occurring symbols are assigned shorter binary codes, while
less frequent symbols receive longer codes, thereby reducing the average code length of the encoded data. This approach
achieves efficient compression without any loss of information, making it suitable for applications where exact reconstruction
of original data is required. Huffman Coding has been extensively used in file compression systems, text processing
applications, image compression standards, and digital communication systems [1].

This research paper presents the implementation and analysis of Huffman Coding and Decoding using MATLAB.
MATLAB provides a powerful computational environment for simulating digital communication algorithms and analyzing
compression performance. The proposed work focuses on constructing Huffman trees based on symbol probabilities,
generating optimal prefix codes, encoding input data into compressed binary sequences, and reconstructing the original
information through the decoding process. The MATLAB implementation demonstrates the practical realization of Huffman
Coding and evaluates the effectiveness of the algorithm using different performance parameters such as compression ratio,
average code length, coding efficiency, and redundancy.

The research further analyzes how symbol probability distribution affects the overall compression performance.
Experimental results indicate that Huffman Coding achieves higher compression efficiency when symbol frequencies are
non-uniform. The encoded output generated through MATLAB simulation significantly reduces data size compared to fixed-
length coding schemes while ensuring accurate recovery of the original message during decoding. The lossless nature of the
algorithm makes it highly reliable for applications involving sensitive textual, image, and multimedia data [2].

In addition to implementation and performance evaluation, this paper discusses the advantages, limitations, and
practical applications of Huffman Coding in modern communication systems. Although several advanced compression
methods such as Arithmetic Coding and Lempel-Ziv-Welch (LZW) have been developed, Huffman Coding continues to
remain a fundamental technique because of its lower computational complexity and efficient real-time performance. The
study also highlights possible future improvements including adaptive Huffman Coding and hybrid compression methods
integrated with intelligent algorithms [3].

The overall objective of this work is to provide a detailed understanding of lossless data compression using Huffman
Coding and to demonstrate its practical implementation in MATLAB for educational and research purposes. The proposed
system proves that Huffman Coding remains an effective solution for minimizing data storage requirements and improving
communication efficiency in digital systems.

Keywords: Data Compression, Huffman Coding, MATLAB, Lossless Compression, Encoding, Decoding, Compression Ratio,
Information Theory.

IJISRT26MAY1486 [Link] 3057

Volume 11, Issue 5, May – 2026 International Journal of Innovative Science and Research Technology
ISSN No : -2456-2165 [Link]

How to Cite: Pulak Kumar Jena; Ramkumar Ghadai; Sudarshan Murmu; Binod Kumar Baliar Sing (2026) Data Compression
Using Huffman Coding & Decoding in MATLAB. International Journal of Innovative Science and Research Technology,11(5),
3057-3065. [Link]

I. INTRODUCTION of each symbol in the input dataset. Symbols are then

arranged in ascending order of probability, and the two least
The development of modern digital technologies has probable symbols are repeatedly combined to construct the
resulted in a tremendous increase in the volume of data tree structure. Binary values are assigned to the branches of
exchanged through communication networks and stored in the tree, typically using ‘0’ for the left branch and ‘1’ for the
electronic devices. Text files, audio signals, images, videos, right branch. The path from the root node to a symbol node
and multimedia applications require large memory capacity determines the binary code assigned to that symbol [5]. The
and high transmission bandwidth for efficient processing and generated codes satisfy the prefix property, meaning that no
communication. The continuous growth of internet services, codeword is the prefix of another codeword, thereby ensuring
cloud computing, and multimedia streaming has further unambiguous decoding.
intensified the demand for efficient data storage and
transmission systems. Consequently, data compression has In recent years, MATLAB has emerged as a highly
become one of the most important research areas in computer effective software platform for implementing and analyzing
science, digital communication, and information technology communication system algorithms. MATLAB provides
[1]. powerful computational tools, matrix processing capabilities,
graphical visualization functions, and built-in
Data compression refers to the process of reducing the communication libraries that simplify the simulation of data
size of digital information by eliminating statistical compression techniques. Therefore, MATLAB is widely used
redundancy while preserving the essential content of the in academic research and engineering applications for
original data. Compression techniques aim to minimize the studying encoding and decoding algorithms [6]. In this
number of bits required to represent information, thereby research work, MATLAB is utilized to implement Huffman
reducing storage space and communication bandwidth. In Encoding and Decoding processes and to evaluate the
general, data compression techniques are classified into two compression performance of the algorithm using different
major categories: lossless compression and lossy input datasets.
compression. Lossless compression techniques preserve the
exact original information after decompression, whereas The proposed work aims to study the theoretical
lossy compression methods permanently remove certain concepts of Huffman Coding and demonstrate its practical
information to achieve higher compression ratios [2]. implementation using MATLAB simulation. The encoding
process converts the original data into compressed binary
Lossless compression is particularly important in sequences based on generated Huffman codes, while the
applications where data accuracy and integrity are critical. decoding process reconstructs the exact original information
Examples include text documents, executable programs, from the compressed data. Performance analysis is carried
medical images, scientific datasets, and database systems. out using parameters such as compression ratio, average code
Huffman Coding is one of the most widely used lossless length, coding efficiency, and redundancy. These parameters
compression techniques due to its ability to generate optimal help in evaluating the effectiveness of the proposed
variable-length prefix codes based on symbol occurrence compression system [7].
probabilities. The algorithm was introduced by David A.
Huffman in 1952 as a method for constructing minimum The importance of Huffman Coding can be observed in
redundancy codes [3]. Since then, Huffman Coding has several practical applications. It is commonly used in text
become a fundamental component of numerous compression compression systems, image compression standards such as
standards and communication protocols. JPEG, multimedia transmission, fax communication, and file
archiving systems. Due to its low computational complexity
The basic principle of Huffman Coding is based on and efficient coding structure, Huffman Coding remains
assigning shorter binary codes to symbols that occur more suitable for real-time applications and embedded
frequently and longer codes to symbols with lower communication systems [8]. Although modern compression
frequencies. This variable-length coding mechanism algorithms have introduced more advanced approaches,
significantly reduces the average number of bits required to Huffman Coding continues to serve as a foundation for many
represent data. Unlike fixed-length coding schemes where hybrid compression techniques and educational research
each symbol is represented using an equal number of bits, studies.
Huffman Coding dynamically allocates code lengths
according to symbol probabilities. As a result, the algorithm This research paper is organized into multiple sections.
achieves improved coding efficiency and better compression The literature review discusses previous research
performance [4]. contributions related to data compression and Huffman
Coding. The methodology section explains the
Huffman Coding uses a binary tree structure called the implementation steps of Huffman Encoding and Decoding
Huffman tree for generating optimal prefix codes. The using MATLAB. Experimental results and performance
algorithm begins by calculating the frequency or probability analysis are then presented, followed by a discussion on

IJISRT26MAY1486 [Link] 3058

Volume 11, Issue 5, May – 2026 International Journal of Innovative Science and Research Technology
ISSN No : -2456-2165 [Link]

advantages, limitations, applications, and future  To study the fundamental principles of data compression
improvements of the proposed system. and understand the significance of lossless compression
techniques in modern digital communication systems.
II. PROBLEM STATEMENT  To analyze the working mechanism of Huffman Coding
including symbol probability calculation, Huffman tree
The exponential growth of digital data in modern construction, and variable-length code generation.
communication systems, cloud storage platforms,  To implement Huffman Encoding and Decoding
multimedia applications, and internet services has created algorithms in MATLAB for efficient compression and
significant challenges related to efficient data storage and accurate reconstruction of digital data.
transmission. Large volumes of textual, audio, image, and  To generate optimal prefix codes based on the frequency
video data require substantial memory space and high of occurrence of input symbols in order to minimize the
bandwidth for communication. Traditional fixed-length average code length.
coding techniques allocate the same number of bits to every  To evaluate the performance of the proposed compression
symbol regardless of their frequency of occurrence, leading system using parameters such as compression ratio,
to inefficient utilization of storage resources and coding efficiency, average code length, and redundancy.
communication channels.  To compare the compressed data size with the original
data size and analyze the effectiveness of Huffman
In many real-time applications, excessive data size Coding in reducing storage requirements.
increases transmission delay, network congestion, storage  To verify the lossless nature of the algorithm by ensuring
cost, and system complexity. Therefore, there is a critical that the decoded output exactly matches the original input
need for an efficient compression technique capable of data without any information loss.
reducing data size without affecting the integrity and  To study the practical applications of Huffman Coding in
accuracy of the original information. Lossless compression areas such as text compression, image processing,
methods are especially important in applications where exact multimedia communication, and file storage systems.
reconstruction of data is required, such as text documents,  To identify the advantages and limitations of Huffman
executable files, medical records, and scientific datasets. Coding and examine its suitability for modern digital
communication and data processing applications.
Huffman Coding is a widely used lossless compression  To provide a foundation for future research involving
technique that addresses these challenges by generating adaptive Huffman Coding, hybrid compression methods,
variable-length binary codes based on the statistical and advanced intelligent compression techniques.
probability of symbols. Frequently occurring symbols are
assigned shorter binary codes, while less frequent symbols IV. LITERATURE REVIEW
receive longer codes, thereby minimizing the average code
length and improving compression efficiency. However, the Several researchers have contributed significantly to
practical implementation and performance analysis of the development and improvement of data compression
Huffman Coding require a systematic computational techniques. Huffman Coding remains one of the most
environment for encoding, decoding, and evaluating effective methods for statistical lossless compression.
compression parameters.
David A. Huffman introduced the Huffman Coding
This research focuses on the implementation of algorithm in 1952 and demonstrated that variable-length
Huffman Coding and Decoding using MATLAB to develop prefix coding could minimize average code length based on
an efficient lossless data compression system. The study aims symbol frequency. His work established the foundation for
to analyze how Huffman Coding reduces redundancy in modern lossless compression methods.
digital data, improves storage efficiency, and ensures
accurate reconstruction of the original information after Claude Shannon developed the theory of information
decompression. The performance of the proposed system is entropy, which greatly influenced compression algorithms.
evaluated using parameters such as compression ratio, coding Shannon’s entropy concept provides the theoretical limit for
efficiency, and redundancy to determine the effectiveness of lossless compression efficiency.
the compression process in modern digital communication
applications. Research by various scholars has shown that Huffman
Coding performs efficiently in text compression, image
III. OBJECTIVES OF THE RESEARCH compression, and multimedia applications. MATLAB-based
implementations have also been widely adopted in academic
The primary objective of this research is to study and and industrial research due to MATLAB’s flexible
implement an efficient lossless data compression technique programming environment and built-in functions.
using Huffman Coding and Decoding in MATLAB. The
research focuses on reducing data redundancy and improving Recent studies have focused on improving Huffman
storage and transmission efficiency through optimal variable- Coding using hybrid methods, adaptive coding, and
length coding methods. The specific objectives of the integration with machine learning techniques. Although
proposed work are as follows: newer algorithms such as Arithmetic Coding and Lempel-
Ziv-Welch (LZW) provide improved performance in some

IJISRT26MAY1486 [Link] 3059

Volume 11, Issue 5, May – 2026 International Journal of Innovative Science and Research Technology
ISSN No : -2456-2165 [Link]

scenarios, Huffman Coding remains popular because of its

simplicity and lower computational complexity. Consider a set of source symbols:

V. FUNDAMENTALS OF HUFFMAN CODING 𝑆 = {𝑠1 , 𝑠2 , 𝑠3 , … , 𝑠𝑛 } (1)

Huffman Coding is a variable-length coding algorithm where each symbol 𝑠𝑖 has an associated probability of
that assigns shorter binary codes to frequently occurring occurrence 𝑃𝑖 .
symbols and longer codes to less frequent symbols.
 The probability distribution satisfies the condition:
 The algorithm follows these steps:
∑𝑛𝑖=1 𝑃𝑖 = 1 (2)
 Calculate the frequency of each symbol.
 Arrange symbols in ascending order of probability.  The objective of Huffman Coding is to minimize the
 Construct a binary tree by combining the two lowest- average code length 𝐿𝑎𝑣𝑔 , which is expressed as:
frequency nodes repeatedly.
 Assign binary values: 𝐿𝑎𝑣𝑔 = ∑𝑛𝑖=1 𝑃𝑖 𝑙𝑖 (3)

 Left branch = 0 Where:

 Right branch = 1
 𝑃𝑖 = Probability of occurrence of symbol 𝑠𝑖
 Generate unique binary codes for each symbol.  𝑙𝑖 = Length of the binary code assigned to symbol 𝑠𝑖
 Encode the input data using generated codes.
The Huffman algorithm generates an optimal prefix
The generated codes satisfy the prefix property, code such that the average code length becomes as close as
meaning no code is the prefix of another code. possible to the entropy of the source.

VI. HUFFMAN TREE CONSTRUCTION The entropy of the source is given by:

Huffman Tree Construction is the fundamental process 𝐻 = − ∑𝑛𝑖=1 𝑃𝑖 log⁡2 𝑃𝑖 (4)

used in Huffman Coding to generate optimal variable-length
binary codes for data compression. The Huffman tree is a According to information theory, the average code
binary tree structure in which symbols with lower length satisfies the condition:
probabilities are placed deeper in the tree, while symbols with
higher probabilities are positioned closer to the root node. 𝐻 ≤ 𝐿𝑎𝑣𝑔 < 𝐻 + 1 (5)
This arrangement minimizes the average code length and
improves compression efficiency. This inequality proves that Huffman Coding produces
near-optimal compression performance.
The construction of the Huffman tree is based on the
statistical occurrence of symbols in the input dataset.  Steps for Huffman Tree Construction
Symbols that appear more frequently are assigned shorter The Huffman tree is constructed using the following
binary codes, whereas symbols with lower occurrence systematic procedure:
frequencies receive longer codes. The resulting coding
structure satisfies the prefix property, ensuring that no  Step 1: Determine Symbol Frequencies
codeword becomes the prefix of another codeword, thereby The frequency or probability of occurrence of each
enabling accurate and unambiguous decoding. symbol in the input dataset is calculated.

Consider the following example:

 Mathematical Representation of Huffman Coding
Table 1 Determine Symbol Frequencies
Symbol Frequency
A 45
B 13
C 12
D 16
E 9
F 5

The total number of symbols is: 45 + 13 + 12 + 16 + 9 + 5 = 100

IJISRT26MAY1486 [Link] 3060

Volume 11, Issue 5, May – 2026 International Journal of Innovative Science and Research Technology
ISSN No : -2456-2165 [Link]

The probability of each symbol is calculated as:

 Step 2: Arrange Symbols in Ascending Order
𝑓𝑖
𝑃𝑖 = ∑𝑓 (6) The symbols are arranged according to increasing
𝑖 probability values:
Where 𝑓𝑖 represents the frequency of the symbol.
Table 2 Arrange Symbols in Ascending Order
Symbol Frequency
F 5
E 9
C 12
B 13
D 16
A 45

 Step 3: Combine the Two Lowest-Frequency Nodes Thus, symbols 𝐹and 𝐸are merged into a new node with
The two nodes with the smallest frequencies are frequency 14.
combined to create a new parent node.
The updated list becomes:
For example:

5 + 9 = 14
Table 3 Combine the Two Lowest-Frequency Nodes
Node Frequency
C 12
B 13
FE 14
D 16
A 45

 Step 4: Repeat the Combination Process VII. HUFFMAN TREE GENERATION

The process continues by repeatedly combining the two
smallest nodes until only one root node remains.  The generated Huffman tree is represented as a binary tree
where:
Next combinations:
 Left branch is assigned binary value ‘0’
12 + 13 = 25  Right branch is assigned binary value ‘1’

14 + 16 = 30 The binary code for each symbol is obtained by tracing

the path from the root node to the corresponding leaf node.
25 + 30 = 55
An example of generated Huffman codes is shown
45 + 55 = 100 below:

The final node with frequency 100 becomes the root

node of the Huffman tree.

Table 4 The generated Huffman tree is represented as a binary tree

Symbol Huffman Code
A 0
B 101
C 100
D 111
E 1101
F 1100

The symbol with the highest probability (𝐴) receives  Average Code Length Calculation
the shortest code, while symbols with lower probabilities The average code length for the generated codes can be
receive longer binary codes. calculated using:

IJISRT26MAY1486 [Link] 3061

Volume 11, Issue 5, May – 2026 International Journal of Innovative Science and Research Technology
ISSN No : -2456-2165 [Link]

𝐿𝑎𝑣𝑔 = ∑𝑃𝑖 𝑙𝑖 (7)  Provides efficient implementation in real-time

communication systems
Substituting the probabilities and code lengths:
 Role of Huffman Tree in MATLAB Implementation
𝐿𝑎𝑣𝑔 = (0.45 × 1) + (0.13 × 3) + (0.12 × 3) In the proposed work, the Huffman tree is generated in
+(0.16 × 3) + (0.09 × 4) + (0.05 × 4) MATLAB using built-in Huffman functions. MATLAB
automatically computes symbol probabilities, constructs the
𝐿𝑎𝑣𝑔 = 0.45 + 0.39 + 0.36 + 0.48 + 0.36 + 0.20 Huffman tree, generates binary code dictionaries, and
performs encoding and decoding operations efficiently.
𝐿𝑎𝑣𝑔 = 2.24 bits/symbol
VIII. MATLAB IMPLEMENTATION
This value is significantly lower than fixed-length
MATLAB is used for implementing Huffman Encoding
coding, demonstrating the effectiveness of Huffman Coding
and Decoding because of its efficient matrix handling and
in reducing storage requirements.
visualization capabilities.
 Advantages of Huffman Tree Construction
 Encoding Algorithm
The Huffman tree construction method offers several
The encoding process includes:
important advantages:
 Reading input data
 Generates optimal prefix codes
 Calculating symbol frequencies
 Minimizes average code length
 Generating Huffman dictionary
 Improves compression efficiency
 Converting symbols into binary codes
 Reduces storage and transmission requirements
 Producing compressed output
 Ensures lossless reconstruction of data

Fig 1 MATLAB Code for Huffman Encoding

 Decoding Algorithm
The decoding process reconstructs the original data from compressed binary codes.

IJISRT26MAY1486 [Link] 3062

Volume 11, Issue 5, May – 2026 International Journal of Innovative Science and Research Technology
ISSN No : -2456-2165 [Link]

Fig 2 MATLAB Code for Huffman Decoding

IX. FLOWCHART OF PROPOSED SYSTEM  Average Code Length

Average code length refers to the average number of
 Encoding Process bits required to represent each symbol after Huffman
Encoding. Since Huffman Coding assigns variable-length
 Start binary codes to symbols, the average code length is generally
 Input Data smaller than fixed-length coding methods.
 Calculate Symbol Frequency
 Generate Huffman Tree The average code length is calculated using the
 Assign Binary Codes weighted sum of symbol probabilities and their
 Encode Data corresponding code lengths:
 Display Compressed Output
𝐿𝑎𝑣𝑔 = ∑𝑛𝑖=1 𝑃𝑖 × 𝑙𝑖 ⁡ (9)
 Stop

 Decoding Process Where:

 Start  𝑃𝑖 = Probability of occurrence of the 𝑖𝑡ℎ symbol

 Read Encoded Data  𝑙𝑖 = Length of the Huffman code assigned to the 𝑖𝑡ℎ symbol
 Traverse Huffman Tree
A lower average code length indicates better coding
 Decode Symbols
efficiency and improved compression performance.
 Reconstruct Original Data
 Stop  Coding Efficiency
Coding efficiency measures how effectively the
X. PERFORMANCE METRICS Huffman Coding algorithm utilizes the available bits in
comparison to the theoretical entropy limit defined by
The efficiency of Huffman Coding is evaluated using information theory. Higher efficiency indicates that the
the following metrics: generated Huffman codes are close to the optimal coding
structure.
 Compression Ratio
Compression Ratio is one of the most important The coding efficiency is calculated as:
parameters used to measure the effectiveness of a
compression technique. It represents the ratio between the 𝐸𝑛𝑡𝑟𝑜𝑝𝑦
size of the original data and the size of the compressed data. 𝐸𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑐𝑦 = 𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝐶𝑜𝑑𝑒 𝐿𝑒𝑛𝑔𝑡ℎ × 100 (10)
A higher compression ratio indicates better compression
performance and more efficient utilization of storage space Coding efficiency is usually expressed as a percentage.
and transmission bandwidth. A value closer to 100% indicates that the compression
technique performs near the theoretical optimum.
The compression ratio is mathematically expressed as:
 Entropy
𝑆𝑖𝑧𝑒 𝑜𝑓 𝑂𝑟𝑖𝑔𝑖𝑛𝑎𝑙 𝐷𝑎𝑡𝑎
𝐶𝑜𝑚𝑝𝑟𝑒𝑠𝑠𝑖𝑜𝑛 𝑅𝑎𝑡𝑖𝑜 = 𝑆𝑖𝑧𝑒 𝑜𝑓 𝐶𝑜𝑚𝑝𝑟𝑒𝑠𝑠𝑒𝑑 𝐷𝑎𝑡𝑎 (8) Entropy represents the average amount of information
contained in a message source. It defines the theoretical
minimum number of bits required to represent the data
If the compressed data size becomes significantly without losing information. Entropy is calculated using the
smaller than the original data size, the compression algorithm probability distribution of symbols.
is considered efficient. In Huffman Coding, the compression
ratio depends on the probability distribution of the symbols The entropy equation is given by:
in the input dataset.
𝐻 = − ∑𝑛𝑖=1 𝑃𝑖 log⁡2 𝑃𝑖 (11)

IJISRT26MAY1486 [Link] 3063

Volume 11, Issue 5, May – 2026 International Journal of Innovative Science and Research Technology
ISSN No : -2456-2165 [Link]

The decoded output perfectly matches the original input

Where: sequence, confirming the lossless nature of the algorithm.
The implementation also shows that Huffman Coding
 𝐻= Entropy of the source achieves significant compression for datasets with non-
 𝑃𝑖 = Probability of occurrence of the 𝑖𝑡ℎ symbol uniform symbol distributions.

Entropy provides a benchmark for evaluating the  Observations

effectiveness of Huffman Coding.
 Compression efficiency increases when symbol
 Redundancy probability distribution is uneven.
Redundancy represents the difference between the  The algorithm is simple and computationally efficient.
actual average code length and the theoretical entropy value.  MATLAB implementation provides accurate encoding
It indicates the extra bits used during the encoding process and decoding operations.
beyond the theoretical minimum requirement.  Huffman Coding is suitable for text, image, and
multimedia compression applications.
The redundancy is expressed as:
XIII. ADVANTAGES OF HUFFMAN CODING
𝑅𝑒𝑑𝑢𝑛𝑑𝑎𝑛𝑐𝑦 = 1 − 𝐸𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑐𝑦 (12)
 Lossless compression technique
Lower redundancy indicates a more efficient  Efficient storage utilization
compression system.  Reduced transmission bandwidth
 Simple implementation
 Reconstruction Accuracy  Optimal prefix coding
Reconstruction accuracy measures the capability of the  Accurate reconstruction of original data
decoding process to recover the original data exactly from the
compressed bit stream. Since Huffman Coding is a lossless XIV. LIMITATIONS OF HUFFMAN CODING
compression technique, the decoded output should be
identical to the original input data without any information  Less effective for uniformly distributed data
loss.  Requires frequency table generation
 Static Huffman Coding may not adapt well to changing
Reconstruction accuracy can be verified by comparing data patterns
the original input sequence with the decoded output sequence  Large datasets may increase tree construction complexity
generated after Huffman Decoding.
XV. APPLICATIONS
XI. EXECUTION TIME
 Huffman Coding is widely used in:
Execution time represents the total time required for
encoding and decoding operations in MATLAB. It provides  Text file compression
information regarding the computational complexity and  Image compression
real-time applicability of the compression system.  JPEG compression
 Multimedia communication
Efficient execution time is important in practical  Fax transmission
communication systems where fast compression and
 File archiving systems
decompression are required for real-time data transmission.
 Wireless communication systems
 Memory Utilization
XVI. FUTURE SCOPE
Memory utilization refers to the amount of memory
required for storing the Huffman tree, code dictionary,
 Future improvements may include:
encoded data, and decoding structures during
implementation. Efficient memory utilization improves the
overall system performance and reduces hardware  Adaptive Huffman Coding implementation
requirements.  Hybrid compression techniques
 Integration with Artificial Intelligence algorithms
XII. RESULTS AND DISCUSSION  Real-time hardware implementation
 Enhanced multimedia compression systems
The MATLAB simulation demonstrates that Huffman
Coding effectively compresses textual data by reducing XVII. CONCLUSION
average code length. Symbols with higher occurrence
frequencies receive shorter codes, leading to reduced storage This research paper presented the implementation of
requirements. Huffman Coding and Decoding using MATLAB for efficient
lossless data compression. The proposed approach

IJISRT26MAY1486 [Link] 3064

Volume 11, Issue 5, May – 2026 International Journal of Innovative Science and Research Technology
ISSN No : -2456-2165 [Link]

successfully reduced data size while preserving complete

information accuracy. MATLAB simulations demonstrated
the effectiveness of variable-length coding in minimizing
average code length and improving storage efficiency.

The study confirmed that Huffman Coding remains a

reliable and computationally efficient compression technique
for digital communication and multimedia applications.
Although modern compression methods provide additional
enhancements, Huffman Coding continues to serve as a
fundamental and widely adopted algorithm in the field of data
compression.

REFERENCES

[1]. Introduction to Data Compression, 5th ed.

Burlington, MA, USA: Morgan Kaufmann, 2017.
[2]. Elements of Information Theory, 2nd ed. Hoboken,
NJ, USA: Wiley-Interscience, 2006.
[3]. David A. Huffman, “A Method for the Construction
of Minimum-Redundancy Codes,” Proceedings of
the IRE, vol. 40, no. 9, pp. 1098–1101, Sep. 1952.
[4]. Claude Shannon, “A Mathematical Theory of
Communication,” Bell System Technical Journal,
vol. 27, pp. 379–423, Jul. 1948.
[5]. Data Compression: The Complete Reference, 4th
ed. London, U.K.: Springer, 2007.
[6]. MATLAB Documentation, MathWorks Official
Website
[7]. Digital Communications, 5th ed. New York, NY,
USA: McGraw-Hill, 2007.
[8]. Information Theory and modern lossless
compression research studies.

IJISRT26MAY1486 [Link] 3065