A context-adaptive-variable-length-coding (CAVLC) decoder cannot determine an exact start position of the k'th syntax element until it decodes the (k - 1)'th syntax element, which makes parallel CAVLC decoding difficult. We propose a new bitstream structure to maximize parallelism of CAVLC decoding. Our algorithm enables us to simultaneously access multiple points from different MBs in a bitstream. Then, a CAVLC decoder can concurrently read multiple symbols from the multiple access points and decode them in parallel. Experimental results show that the proposed algorithm significantly increases decoding speed without sacrificing coding efficiency.