{"id":21258324,"url":"https://github.com/josgard94/text-compressor-using-huffman-codes","last_synced_at":"2026-05-11T03:51:51.024Z","repository":{"id":136452715,"uuid":"192170650","full_name":"josgard94/Text-compressor-using-huffman-codes","owner":"josgard94","description":"This source code implements the huffman algorithm to perform the compression of a plain text file. for this a file is generated which contains the probabilities of each of the symbols defined in the symbols dictionary.","archived":false,"fork":false,"pushed_at":"2019-06-19T21:25:14.000Z","size":1679,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-21T21:34:08.847Z","etag":null,"topics":["c","c-plus-plus","coding-","coding-and-data-compression","compression-algorithm","huffman-coding","huffman-compression-algorithm","information-theory","python","text-compression"],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/josgard94.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-06-16T09:03:07.000Z","updated_at":"2022-02-11T07:02:50.000Z","dependencies_parsed_at":null,"dependency_job_id":"fbe6b321-9b2e-41eb-8dd5-9e046f69d07d","html_url":"https://github.com/josgard94/Text-compressor-using-huffman-codes","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/josgard94%2FText-compressor-using-huffman-codes","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/josgard94%2FText-compressor-using-huffman-codes/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/josgard94%2FText-compressor-using-huffman-codes/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/josgard94%2FText-compressor-using-huffman-codes/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/josgard94","download_url":"https://codeload.github.com/josgard94/Text-compressor-using-huffman-codes/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243692608,"owners_count":20332229,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["c","c-plus-plus","coding-","coding-and-data-compression","compression-algorithm","huffman-coding","huffman-compression-algorithm","information-theory","python","text-compression"],"created_at":"2024-11-21T04:08:23.090Z","updated_at":"2026-05-11T03:51:45.970Z","avatar_url":"https://github.com/josgard94.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Text-compressor-using-huffman-codes\nThis source code implements the huffman algorithm to perform the compression of a plain text file. for this a file is generated which contains the probabilities of each of the symbols defined in the symbols dictionary.\n\n\nTo execute this algorithm correctly, you must first compile the code in c that generates the probability of the symbols set in it.\n\n\nAs a second step you must execute the source code corresponding to the Huffman encoder. The execution of this will generate a .dat file which is the compressed text file. Note: When performing the Hamming algorithm and to achieve a considerable reduction in the size of the text file, the writing of the .dat file is done directly to disk using a writing strategy that allows to write byte by byte the data.\n\nFinally, to recover the text file, execute the corresponding source code for the decoder.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjosgard94%2Ftext-compressor-using-huffman-codes","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjosgard94%2Ftext-compressor-using-huffman-codes","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjosgard94%2Ftext-compressor-using-huffman-codes/lists"}