This paper presents a simple yet efficient erasure code based on Vandermonde matrices for use in network protocols. The code is designed to handle packet losses in reliable communication protocols, particularly in multicast scenarios where traditional ARQ techniques are inefficient. Erasure codes allow receivers to reconstruct lost data without requiring retransmissions, making them suitable for applications where feedback is not feasible or desirable. The code is implemented using matrices over finite fields, specifically GF(p^r), and is efficient on common microprocessors. It can be used in various applications, including unicast and multicast protocols, and is capable of encoding and decoding data at speeds up to several MB/s on a Pentium 133 processor. The paper discusses the principles of erasure codes, their implementation, and performance. It highlights the advantages of using erasure codes over traditional ARQ techniques, particularly in scenarios with high packet loss rates. The code is described in detail, including its use of Vandermonde matrices and the efficiency of its implementation. The paper also discusses the performance of the code, showing that it can be used in a wide range of applications, including real-time communication and data distribution. It notes that while erasure codes are computationally intensive, they can be efficiently implemented on modern processors, making them suitable for a variety of network applications. The code is available for download and can be used in both unicast and multicast scenarios to improve reliability and reduce the need for feedback.This paper presents a simple yet efficient erasure code based on Vandermonde matrices for use in network protocols. The code is designed to handle packet losses in reliable communication protocols, particularly in multicast scenarios where traditional ARQ techniques are inefficient. Erasure codes allow receivers to reconstruct lost data without requiring retransmissions, making them suitable for applications where feedback is not feasible or desirable. The code is implemented using matrices over finite fields, specifically GF(p^r), and is efficient on common microprocessors. It can be used in various applications, including unicast and multicast protocols, and is capable of encoding and decoding data at speeds up to several MB/s on a Pentium 133 processor. The paper discusses the principles of erasure codes, their implementation, and performance. It highlights the advantages of using erasure codes over traditional ARQ techniques, particularly in scenarios with high packet loss rates. The code is described in detail, including its use of Vandermonde matrices and the efficiency of its implementation. The paper also discusses the performance of the code, showing that it can be used in a wide range of applications, including real-time communication and data distribution. It notes that while erasure codes are computationally intensive, they can be efficiently implemented on modern processors, making them suitable for a variety of network applications. The code is available for download and can be used in both unicast and multicast scenarios to improve reliability and reduce the need for feedback.