Abstract
This paper demonstrates a new lossless compression framework. The (A-M) code is a hybrid technique of three major components. The first component is a fixed dictionary (A-M dictionary) of gathered symbols where the word length might one of three lengths; 8, 10 or 12 bits each. The second component is the A-M transform that applies over the input text file in order to generate the A-M intermediate code with a compression ration up to 25% of the original file. The third component is used to apply a customized variable-length code such as Huffman algorithm in order to achieve the final output. After illustrating each part of the algorithm; two case studies with comparison to famous lossless compression techniques are shown with results. Finally, next steps for enhancement and open research issues to improve the A-M algorithm are discussed.