Enhancement of Markov chain-based linguistic steganography with binary encoding for securing legal documents (Record no. 37405)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02017nam a22001577a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | FT8919 |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA76.9 A43 H35 2025 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Halili, Ace Byrone S.; Salangsang, Giedeon Antony B. |
| 245 ## - TITLE STATEMENT | |
| Title | Enhancement of Markov chain-based linguistic steganography with binary encoding for securing legal documents |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Date of production, publication, distribution, manufacture, or copyright notice | c2025 |
| 336 ## - CONTENT TYPE | |
| Source | text |
| Content type term | text |
| Content type code | text |
| 337 ## - MEDIA TYPE | |
| Source | unmediated |
| Media type term | unmediated |
| Media type code | unmediated |
| 338 ## - CARRIER TYPE | |
| Source | volume |
| Carrier type term | volume |
| Carrier type code | volume |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | ABSTRACT: This study addresses the limitations of traditional linguistic steganography by enhancing a Markov Chain-based algorithm with binary encoding to improve efficiency, capacity, and reliability. Conventional methods often suffer from slow processing, low embedding capacity, and poor decoding accuracy due to complex encoding mechanisms and lack of optimization, making them unsuitable for high-speed, precise applications. The proposed enhancements remove Huffman tree construction, reducing time complexity to O(1) and achieving up to a 54-fold improvement in encoding and decoding efficiency for large bitstreams. Embedding rates are further optimized through entry point utilization and binary indexing, with Markov models of state sizes 2 and 3 enabling higher data capacities while keeping outputs compact. To ensure robustness, a validation mechanism for incomplete bit groups was introduced, yielding a 100% decoding success rate compared to only 4% in existing methods. Imperceptibility was measured using perplexity, confirming that the algorithm generates human-like text at higher state sizes. These advancements make the algorithm suitable for securely embedding sensitive data in domains such as legal and financial communications. Overall, the enhanced algorithm offers a fast, reliable, and scalable solution for text-based steganography, overcoming the inefficiencies of prior methods and contributing significantly to the theoretical and practical development of secure information hiding techniques. |
| 942 ## - ADDED ENTRY ELEMENTS | |
| Source of classification or shelving scheme | |
| Item type | Thesis/Dissertation |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Permanent Location | Current Location | Shelving location | Date acquired | Fund Source | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Filipiniana-Thesis | PLM | PLM | Filipiniana Section | 2025-10-24 | donation | QA76.9 A43 H35 2025 | FT8919 | 2026-01-07 | 2026-01-07 | Thesis/Dissertation |