Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.459
JCR 5-Year IF: 0.442
Issues per year: 4
Current issue: Nov 2016
Next issue: Feb 2017
Avg review time: 98 days


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 644266260
doi: 10.4316/AECE


TRAFFIC STATS

1,465,578 unique visits
469,971 downloads
Since November 1, 2009



No robots online now


SJR SCImago RANK

SCImago Journal & Country Rank


SEARCH ENGINES

aece.ro - Google Pagerank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 16 (2016)
 
     »   Issue 4 / 2016
 
     »   Issue 3 / 2016
 
     »   Issue 2 / 2016
 
     »   Issue 1 / 2016
 
 
 Volume 15 (2015)
 
     »   Issue 4 / 2015
 
     »   Issue 3 / 2015
 
     »   Issue 2 / 2015
 
     »   Issue 1 / 2015
 
 
 Volume 14 (2014)
 
     »   Issue 4 / 2014
 
     »   Issue 3 / 2014
 
     »   Issue 2 / 2014
 
     »   Issue 1 / 2014
 
 
 Volume 13 (2013)
 
     »   Issue 4 / 2013
 
     »   Issue 3 / 2013
 
     »   Issue 2 / 2013
 
     »   Issue 1 / 2013
 
 
  View all issues  








LATEST NEWS

2016-Jun-14
Thomson Reuters published the Journal Citations Report for 2015. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.459, and the JCR 5-Year Impact Factor is 0.442.

2015-Dec-04
Starting with Issue 2/2016, the article processing charge is 300 EUR for each article accepted for publication. The charge of 25 EUR per page for papers over 8 pages will not be changed. Details are available in the For authors section.

2015-Jun-10
Thomson Reuters published the Journal Citations Report for 2014. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.529, and the JCR 5-Year Impact Factor is 0.476.

2015-Feb-09
Starting on the 9th of February 2015, we require all authors to identify themselves, when a submission is made, by entering their SCOPUS Author IDs, instead of the organizations, when available. This information will let us better know the publishing history of the authors and better assign the reviewers on different topics.

2015-Feb-08
We have more than 500 author names on the ban-list for cheating, including plagiarism, false signatures on the copyright form, false E-mail addresses and even tentative to impersonate well-known researchers in order to become a reviewer of our Journal. We maintain a full history of such incidents.

Read More »


    
 

  4/2010 - 12

Analysis of Linear Block Codes as Sources with Memory

MUNTEANU, V. See more information about MUNTEANU, V. on SCOPUS See more information about MUNTEANU, V. on IEEExplore See more information about MUNTEANU, V. on Web of Science, TARNICERIU, D. See more information about  TARNICERIU, D. on SCOPUS See more information about  TARNICERIU, D. on SCOPUS See more information about TARNICERIU, D. on Web of Science, ZAHARIA, G. See more information about ZAHARIA, G. on SCOPUS See more information about ZAHARIA, G. on SCOPUS See more information about ZAHARIA, G. on Web of Science
 
Click to see author's profile on See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (1,250 KB) | Citation | Downloads: 713 | Views: 2,049

Author keywords
information quantities, linear, block codes, sources with memory

References keywords
information(8), sources(7), munteanu(7), zaharia(6), tarniceriu(6), theory(4)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2010-11-30
Volume 10, Issue 4, Year 2010, On page(s): 77 - 80
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2010.04012
Web of Science Accession Number: 000284782700012
SCOPUS ID: 78649691077

Abstract
Quick view
Full text preview
The linear, binary, block codes with no equally likely probabilities for the binary symbols are analyzed. The encoding graph for systematic linear block codes is proposed. These codes are seen as sources with memory and the information quantities H(S,X), H(S), H(X), H(X|S), H(S|X), I(S,X) are derived. On the base of these quantities, the code performances are analyzed.


References | Cited By  «-- Click to see who has cited this paper

[1] T. M. Cover, J. A. Thomas, Elements of Information Theory. John Wiley and Sons, 1991.

[2] R. Yeung, A First Course in Information Theory. Kluwer Academic Publisher, 2002.

[3] V. Munteanu, D. Tarniceriu, Elements of Information Theory. Ed. Cermi, 2007.

[4] V. Munteanu, Teoria codarii informatiei. Ed. Politehnium, 2009.

[5] G. R. Gallager, Information Theory and Reliable Communications. Wiley, 1968.

[6] R. E. Blahut, R. Koetter, "Codes, Graphs and Systems", Kluwer Academic Publishers, 2001.

[7] V. Munteanu, D. Tarniceriu, "New Possibilities to Characterize Ergodic Sources with Memory", Buletinul Institutului Politehnic Iasi, Tomul L (LIV), Fasc. 1-2, pp. 22-30, 2004.

[8] V. Munteanu, D. Tarniceriu, "An Encoding Procedure of Sources with Memory", Buletinul Institutului Politehnic Iasi, Tomul L (LIV), Fasc. 1-2, pp.19-25, 2005

[9] V. Munteanu, D. Tarniceriu, G. Zaharia, "Analysis of lossless compression for a large class of sources of information", Proc. ISSCS, vol. 2, pp. 545-548, July 9-10, 2009, Iasi, Romania.

[10] D. Tarniceriu, V. Munteanu, G. Zaharia, "Information analysis for a large class of discrete sources", , Proc. ISSCS, vol. 2, vol. 2, pp. 553-556, July 9-10, 2009, Iasi, Romania.

[11] G. Zaharia, V. Munteanu, D. Tarniceriu, "Tight bounds on the codeword lengths and average codeword length for d-ary Huffman codes" - part 1, 2, , Proc. ISSCS, vol. 2,, pp. 537-544, July 9-10, 2009, Iasi, Romania.

[12] G. Zaharia, I. Cleju, "The series of auxiliary sources and the characterization function of information sources", Jubilee Scientific Session "75 years of electrical education in Iasi" (in Romanian), 16-17 mai, 1986, pp. 21-24.

[13] G. Zaharia, I. Cleju, "Monotony theorem of characterization functions" Jubilee Scientific Session "75 years of electrical education in Iasi" (in Romanian), 16-17 mai, 1986, pp. 25-28.

[14] G. Zaharia, I. Cleju, "Criteria for establishing the type of secondary information sources", Jubilee Scientific Session "75 years of electrical education in Iasi", (in Romanian), 16-17 mai, 1986, pp. 35-38.

References Weight

Web of Science® Citations for all references: 0
SCOPUS® Citations for all references: 0

Web of Science® Average Citations per reference: 0
SCOPUS® Average Citations per reference: 0

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2016-12-08 21:39 in 3 seconds.




Note1: Web of Science® is a registered trademark of Thomson Reuters.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2016
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania


All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.




Website loading speed and performance optimization powered by: