Special Issue "Data Compression, Communication and Processing"

Quicklinks

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (15 November 2011)

Special Issue Editor

Guest Editor
Prof. Dr. Bruno Carpentieri
Dipartimento di Informatica ed Applicazioni, "Renato M.Capocelli", Universita' di Salerno, Via Ponte Don Melillo, 84084 Fisciano (SA), Italy
Website: http://www.dia.unisa.it/professori/bc/
E-Mail: bc@dia.unisa.it
Phone: +39 089 969 500

Special Issue Information

Dear Colleagues,

There is a strict relationship that links data compression, data communication and data processing. This is testified by the growing interest for efficient compression, communication and processing techniques that the new media are demanding. This special issue is devoted to the exploitation of the many facets of this relationship and explores the current state of the art of the research in compression and in communication.

The topics of interest of this Special Issue covers the scope of theCCP2011 Conference (http://ccp2011.dia.unisa.it).

Extended versions of papers presented at CCP2011 are sought, but this call for papers is fully open to all who want to contribute by submitting a relevant research manuscript.

Prof. Dr. Bruno Carpentieri
Guest Editor

Submission

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.

Published Papers (10 papers)

by ,  and
Algorithms 2012, 5(2), 236-260; doi:10.3390/a5020236
Received: 30 December 2011; in revised form: 28 March 2012 / Accepted: 29 March 2012 / Published: 10 April 2012
Show/Hide Abstract | PDF Full-text (555 KB)

by ,  and
Algorithms 2012, 5(2), 214-235; doi:10.3390/a5020214
Received: 30 January 2012; in revised form: 26 March 2012 / Accepted: 28 March 2012 / Published: 10 April 2012
Show/Hide Abstract | Cited by 1 | PDF Full-text (347 KB)

by , ,  and
Algorithms 2012, 5(1), 113-147; doi:10.3390/a5010113
Received: 13 February 2012; in revised form: 6 March 2012 / Accepted: 6 March 2012 / Published: 14 March 2012
Show/Hide Abstract | PDF Full-text (778 KB) | HTML Full-text | XML Full-text

by  and
Algorithms 2012, 5(1), 98-112; doi:10.3390/a5010098
Received: 17 November 2011; in revised form: 20 February 2012 / Accepted: 20 February 2012 / Published: 29 February 2012
Show/Hide Abstract | PDF Full-text (804 KB)

by  and
Algorithms 2012, 5(1), 76-97; doi:10.3390/a5010076
Received: 16 November 2011; in revised form: 18 January 2012 / Accepted: 30 January 2012 / Published: 20 February 2012
Show/Hide Abstract | PDF Full-text (904 KB) | HTML Full-text | XML Full-text

by
Algorithms 2012, 5(1), 50-55; doi:10.3390/a5010050
Received: 14 November 2011; in revised form: 11 February 2012 / Accepted: 13 February 2012 / Published: 17 February 2012
Show/Hide Abstract | PDF Full-text (153 KB)

by , ,  and
Algorithms 2012, 5(1), 30-49; doi:10.3390/a5010030
Received: 14 November 2011; in revised form: 22 January 2012 / Accepted: 22 January 2012 / Published: 14 February 2012
Show/Hide Abstract | PDF Full-text (650 KB)
abstract graphic

by , , ,  and
Algorithms 2012, 5(1), 1-17; doi:10.3390/a5010001
Received: 23 August 2011; in revised form: 6 December 2011 / Accepted: 19 December 2011 / Published: 10 January 2012
Show/Hide Abstract | PDF Full-text (2242 KB) | HTML Full-text | XML Full-text

by
Algorithms 2011, 4(4), 307-333; doi:10.3390/a4040307
Received: 23 September 2011; in revised form: 18 October 2011 / Accepted: 30 October 2011 / Published: 1 November 2011
Show/Hide Abstract | PDF Full-text (320 KB) | HTML Full-text | XML Full-text

by
Algorithms 2011, 4(3), 183-199; doi:10.3390/a4030183
Received: 29 July 2011; in revised form: 23 August 2011 / Accepted: 30 August 2011 / Published: 14 September 2011
Show/Hide Abstract | Cited by 1 | PDF Full-text (167 KB) | HTML Full-text | XML Full-text

Last update: 30 April 2012

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert