An Efficient Compression Scheme for Data Communication Which Uses a New Family of Self-Organizing Binary Search Trees

International Journal of Communication Systems - United States
doi 10.1002/dac.943
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

Growing Self Organizing Map With an Imposed Binary Search Tree for Discovering Temporal Input Patterns

2009English

A New Highly Efficient Algorithm for Lossless Binary Image Compression.

English

Supernode Binary Search Trees

International Journal of Foundations of Computer Science
Computer Science
2003English

Optimum Binary Search Trees

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
1972English

Self-Organizing Linear Search

ACM Computing Surveys
Computer ScienceTheoretical Computer Science
1985English

A Hybrid Lossless-Lossy Binary Image Compression Scheme

International Journal of Computer Vision and Image Processing
2013English

An Efficient Polarization-Amplitude-Phase Modulation Scheme for Wireless Communication

SCIENTIA SINICA Informationis
2015English

Image Compression Using Binary Space Partitioning Trees

IEEE Transactions on Image Processing
Computer GraphicsComputer-Aided DesignSoftware
1996English

An Efficient Scheme for Interprocessor Communication Using Dual-Ported RAMs

IEEE Micro
HardwareElectronic EngineeringElectricalArchitectureSoftware
1989English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy