Matrix embedding (ME) encodes cover objects and secret messages with an error correction code and modifies the cover data according to the coding result.The modification vector is the coset leader of error correction codes and the messages are conveyed by the syndrome.How to find the coset leader with lower computational complexity is the core of ME design.To improve the embedding efficiency and embedding speed of small payloads ME

this paper discusses the feasibility of introducing Hamming codes into the parity check matrix (PCM) of random linear codes

and proposes a new PCM structure.On this basis

an optimization scheme is proposed which can adaptively generate a PCM to accommodate to the given cover length and provide the best performance while guaranteeing the desired computational complexity.Experimental results show that this new method achieves higher embedding efficiency and faster embedding speed than previous fast ME methods

and is more suitable for real-time steganogaphic systems.