In 2005, Nicolas Sendrier proposed an algorithm with linear complexity to decode binary information into constant weight words. In this paper, we verify that the algorithm is fully decodable, use it to increase the information rate of a McEliece Cryptosystem while rejecting competing compression techniques, and hypothesize that for a given security requirement, the chosen parameters must be as large as the allowable key size for faster encryption.
