New upper bounds on codes via association schemes and linear programming

An optical receiver especially useful for digital fiber optic systems operating a high pulse rates, converts the pulsed current signal generated by a PIN diode into a pulsed voltage utilizing a current to voltage converter comprising an FET input transistor, a complimentary cascoded bipolar transistor, and a large feedback resistor to reduce noise while providing a wide band width and dynamic range. The pulsed voltage signal is amplitude limited in a limiting amplifier and passed through a low pass filter to remove excess bandwidth and further reduced noise before being applied to a high speed comparator which generates the digital output. The pulsed voltage signal is passed from the current to voltage converter to the limiting amplifier through an emitter follower coupling transistor to isolate the open loop gain of the current to voltage converter so that its band width will not be changed with load.

[1]  Simon Litsyn,et al.  Improved upper bounds on sizes of codes , 2002, IEEE Trans. Inf. Theory.

[2]  Cornelis de Vroedt,et al.  Upper bounds for A(n, 4) and A(n, 6) derived from Delsarte's linear programming bound , 1982, Discret. Math..

[3]  Simon Litsyn,et al.  Survey of binary Krawtchouk polynomials , 1999, Codes and Association Schemes.

[4]  P. Hammond.  Nearly perfect codes in distance-regular graphs , 1976, Discret. Math..

[5]  Alexander Vardy,et al.  Upper bounds for constant-weight codes , 2000, IEEE Trans. Inf. Theory.

[6]  Selmer M. Johnson.  A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.

[7]  Andries E. Brouwer,et al.  The triply shortened binary Hamming code is optimal , 1977, Discret. Math..

[8]  N. J. A. Sloane,et al.  Bounds for binary codes of length less than 25 , 1978, IEEE Trans. Inf. Theory.

[9]  Alexander Vardy,et al.  Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes , 2004, IEEE Transactions on Information Theory.

[10]  C. V. Pul.  On bounds on codes , 1982 .

[11]  M. R. Best,et al.  Binary codes with minimum distance four , 1978 .

[12]  李幼升,et al.  Ph , 1989 .

[13]  Alexander Schrijver,et al.  New code upper bounds from the Terwilliger algebra and semidefinite programming , 2005, IEEE Transactions on Information Theory.

[14]  P. Delsarte.  Bounds for unrestricted codes, by linear programming , 1972 .

[15]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .