A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing

1. Kasami T. and Lin S., "Coding for a Multiple access channel", IEEE Trans. On Inf. Theory, Vol. IT-22, No.2, pp 129–137, March 1976.

   Article  MathSciNet  Google Scholar 

2. Chang., S. C. and Weldon, Jr., E. J. “Coding for T-user multiple access channel,” IEEE Trans. Inform. Theory, vol. IT-25, no. 6, pp. 684–691, Nov. 1979.

   Article  MathSciNet  Google Scholar 

3. Coebergh van den Braak P.A.B. M. and van Tilborg, H. C. A., “A class of uniquely decodable code pairs for the two-access binary adder channel,” IEEE Trans. Inform. Theory, vol. IT-31, no.1, pp. 3–9, Jan. 1985.

   Article  Google Scholar 

4. Ahlswede, R and Balakirsky, V. B, “Construction of Uniquely Decodable Codes for the Two-user Binary Adder Channel”, IEEE Trans. Inform. Theory, vol. 45 N. 1 pp. 326–330, Jan.1999.

   Article  MATH  MathSciNet  Google Scholar 

5. Farrell P. G., “Survey of channel coding for multi-user systems”, in Skwirzynski, J.K. (Ed.): ‘New concepts in multi-user communications’ (Sijthoff and Noordhoff, 1981), pp. 133–159.

   Google Scholar 

6. Bridge, P., “Collaborative Coding for Optical Fibre multi-user Channels”, in Skwirzynski, J.K. (Ed.) “Performance limits in communication theory and practice”, Kluwer, 1988, pp 99–111.

   Google Scholar 

7. Farrell P. G., Brine A., Clark A. P., and Tait, D. J., “Collaborative Coding for Optical Fibre multi-user Channels”, in Skwirzynski, J.K. (Ed.) “Limits of radio communication — collaborative transmission over cellular radio channels”, Kluwer, 1988, pp 281–307.

   Google Scholar 

8. Markarian G., Honary B. and Benachour, P., "Trellis decoding techniques for the binary adder channel with M users", IEE Proceedings on Communications, vol.144, 1997.

   Google Scholar 

9. MacWilliams F. J. and Sloane N. J. A., “The Theory of Error Correcting Codes”, Elsevier Science Publishers, North-Holland 1977, Chapter 2, page 76.

   MATH  Google Scholar 

10. O’Reilly J.J., “Telecommunication Principles”, Van Nostrand Reinhold (UK), 1984.

    Google Scholar 

11. Takasaka Y., Yamashida K. and Tokahashi Y., “Two level AMI coding family for optical fibre systems”, International Journal of Electronics, vol. 55, No. 1, pp. 121–131, 1983.

    Article  Google Scholar 

12. Cattermole K. W., O’Reilly J.J. “Problems of randomness in communications engineering”, vol.2, Pentech Press, London 1984.

    Google Scholar 

13. Bylanski, P and Ingram, D. G. W., “Digital Transmission Systems”, Peter Peregrinus (IEE), Second Edition, 1980.

    Google Scholar 

14. Justesen J., “information rates and power spectra of digital codes”, IEEE Trans. Inform. Theory, vol. IT-28, No.3, pp.457–472, May 1982.

    Article  MathSciNet  Google Scholar 

15. Chang, S. C.,“Coding for the Multiple Access Adder channel with and without Idle Sources”, Elec. Letters, Vol 31, N. 7, pp 523–4, 30th of March 1995.

    Article  Google Scholar 

16. Sidorenko V., Markarian G. and Honary B., "Minimal trellis design for linear codes based on the Shannon product", IEEE Trans. Inform. Theory, vol. 42 pp. 2048–2053, Nov.1996.

    Article  MATH  MathSciNet  Google Scholar 

Download references