Interleaving Burst Protection

Problem

Interleaving with depth D spreads consecutive symbols across D codewords, so if each codeword can correct t errors, a burst is handled as long as its length does not exceed D * t. Return the maximum correctable burst length. Assume D >= 1 and t >= 0.

Hint

Each codeword receives only every D-th symbol of the burst.

Test cases

case 1

in: [5,2]

expected: 10

case 2

in: [1,3]

expected: 3

case 3

in: [10,1]

expected: 10

case 4

in: [4,0]

expected: 0

Starter codePython

def interleaving_burst_protection(depth, t):
    # Your code here
    pass

4 test cases · run your code against them in the editor