A nearly-optimal Fano-based coding algorithm

Author： Rueda L.G.   Oommen B.J.  

Publisher： Elsevier

ISSN： 0306-4573

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

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

Related content

A fast algorithm for constructing nearly optimal prefix codes

By  

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

John Wiley & Sons Inc

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

A compact genetic algorithm for the network coding based resource minimization problem

By Xing Huanlai  

Applied Intelligence, Vol. 36, Iss. 4, 2012-06 ,pp. : 809-823

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Coding and Sampling of Triangulations

By Poulalhon Dominique   Schaeffer Gilles  

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 505-527

Springer Publishing Company

Access to resources Recommend Favorite

A Genetic Algorithm Based Approach to Optimal Toll Level and Location Problems

By  

Networks and Spatial Economics, Vol. 4, Iss. 2, 2004-06 ,pp. : 161-179

Springer Publishing Company

Access to resources Recommend Favorite