Considering the code $BCH(15,7)$ whose generating polynomial $isg(X)=1+X^4+X^6+X^7+X^8.$ The ability $to$ correct $upto2$ erros $in$ the block and $5is$ the minimum distance.

The encode message $ism=[1001000].$

calculate which coded block must have a systematic form, that $is,c=[c_0...c_{14}]=[b_0...b_7,m_0...m_6].$ where $b=[b_0...b_7]$ are the parity bits obtained from the message.