A fast algorithm for constructing nearly optimal prefix codes

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-024x|46|10|1299-1316

ISSN： 0038-0644

Source： SOFTWARE:PRACTICE AND EXPERIENCE, Vol.46, Iss.10, 2016-10, pp. : 1299-1316

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A new approach to constructing optimal parallel prefix circuits with small depth

By Lin Y.-C.   Hsiao J.-W.  

Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. : 97-107

Elsevier

Access to resources Recommend Favorite

A nearly-optimal Fano-based coding algorithm

By Rueda L.G.   Oommen B.J.  

Information Processing and Management, Vol. 40, Iss. 2, 2004-03 ,pp. : 257-268

Elsevier

Access to resources Recommend Favorite

On the lattice of prefix codes

By Restivo A.   Silva P.V.  

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 755-782

Elsevier

Access to resources Recommend Favorite

A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon

By Berman P.   Lingas A.  

Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. : 193-202

Elsevier

Access to resources Recommend Favorite

Fast parallel string prefix-matching

By Breslauer D.  

Theoretical Computer Science, Vol. 137, Iss. 2, 1995-01 ,pp. : 269-278

Elsevier

Access to resources Recommend Favorite