Adjective
paddable (not comparable) (computing theory) Capable of being padded; said of a set whose strings can be transformed into infinitely many further strings in the set.