A fast DCT algorithm will require roughly double the arithmetic operations per sample when the linear transform point size is doubled.
This introduces additional side information overhead and forces the decoder to implement programmable or hardwired recursive DCT algorithms.