pd-sets for codes related to flag-transitive symmetric designs

‎for any prime $p$ let $c_p(g)$ be the $p$ary code spanned by the rows of the incidence matrix $g$ of a graph $gamma$‎. ‎let $gamma$ be the incidence graph of a flagtransitive symmetric design $d$‎. ‎we show that any flagtransitive‎ ‎automorphism group of $d$ can be used as a pdset for full error correction for the linear code $c_p(g)$‎ ‎(with any information set)‎. ‎it follows that such codes derived from flagtransitive symmetric designs can be‎ ‎decoded using permutation decoding‎. ‎in that way to each flagtransitive symmetric $(v‎, ‎k‎, ‎lambda)$ design we associate a linear code of length $vk$ that is‎ ‎permutation decodable‎. ‎pdsets obtained in the described way are usually of large cardinality‎. ‎by studying codes arising from some flagtransitive symmetric designs we show that smaller pdsets can be found for‎ ‎specific information sets‎.