Symbolic Execution is a widely used technique for program testing and analysis. When a program executes a trace symbolically, it simulates all possible paths. This results in an exponential growth of ...

We produce an upper bound on the number of extended irreducible binary quartic Goppa codes of length 2n+1, where n > 3 is a prime number.