p. 39-40
Guided Scrambling (GS) encoding evaluates all candidates codewords generated from all possible combinations of control bits to find a balanced code array with the maximum strength value. In this paper, we applied binary particle swarm optimization for finding balanced code array with good strength value. In the computational results, we show average strengths and symbol balance errors from particle swarm optimization heuristic. We find that the average strength value computed from particle swarm optimization heuristic is quite tight to the GS encoding method using only 6% of the candidate codewords.
