Special Issue "Data Compression"
A special issue of Algorithms (ISSN 1999-4893).
Deadline for manuscript submissions: closed (30 September 2009)
Dr. David Salomon
Computer Science Department (Retired), California State University, Northridge, CA 91330-8281, USA
Phone: +1 619 443 6528
Fax: +1 619 749 5229
Interests: computer graphics; data compression; cryptography
Data compression is the operation of converting an input data file to a smaller file. This operation is important for the following reasons: 1. People like to accumulate data. Thus, no matter how big a storage device one has, sooner or later it is going to fill up. 2. People hate to wait for data transfers. We often upload and download files from our computers and we hate to wait for long, slow data transfers. How can data be compressed? We can represent the same amount of information in fewer bits because the original data representation is not the shortest possible. It is intentionally long in order to simplify processing the data. We say that our data representations have redundancies. Compressing data is done by locating its redundancies and reducing or eliminating them. Thus, the field of data compression tries to understand the sources of redundancies in different types of data and find clever methods to eliminate them. Today, after decades of research, there are hundreds of algorithms and dozens of implementations that can reduce the size of all types of digital data. It is my hope that this issue of Algorithms will make a significant contribution toward this goal.
Dr. David Salomon
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. Papers will be published continuously (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are refereed through a peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed Open Access quarterly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 300 CHF (Swiss Francs). English correction and/or formatting fees of 250 CHF (Swiss Francs) will be charged in certain cases for those articles accepted for publication that require extensive additional formatting and/or English corrections.
- data compression
- data coding
- source coding
- information theory
- data redundancy
- variable-length codes
Article: Graph Compression by BFS
Algorithms 2009, 2(3), 1031-1044; doi:10.3390/a2031031
Received: 30 June 2009; in revised form: 20 August 2009 / Accepted: 21 August 2009 / Published: 25 August 2009| Download PDF Full-text (261 KB)
Algorithms 2009, 2(3), 1105-1136; doi:10.3390/a2031105
Received: 9 July 2009; in revised form: 8 September 2009 / Accepted: 9 September 2009 / Published: 10 September 2009| Download PDF Full-text (334 KB)
Algorithms 2009, 2(3), 1221-1231; doi:10.3390/a2031221
Received: 25 June 2009; in revised form: 31 August 2009 / Accepted: 15 September 2009 / Published: 22 September 2009| Download PDF Full-text (303 KB)
Algorithms 2009, 2(4), 1429-1448; doi:10.3390/a2041429
Received: 30 September 2009 / Accepted: 20 November 2009 / Published: 25 November 2009| Download PDF Full-text (267 KB)
Algorithms 2010, 3(1), 63-75; doi:10.3390/a3010063
Received: 4 November 2009; in revised form: 8 January 2010 / Accepted: 25 January 2010 / Published: 29 January 2010| Download PDF Full-text (375 KB)
Algorithms 2010, 3(2), 145-167; doi:10.3390/a3020145
Received: 23 December 2009; in revised form: 18 March 2010 / Accepted: 18 March 2010 / Published: 1 April 2010| Download PDF Full-text (580 KB)
Last update: 9 March 2011